All Questions
Tagged with enumerative-combinatorics co.combinatorics
393 questions
2
votes
0
answers
83
views
Formula for sum involving products of (symplectic) Schur functions
This question is a continuation of a question asked yesterday which had a very nice answer.
Consider the summation
$$\sum_{\lambda \subset (k)^n} \dim S_{\lambda^t} (\mathbb{C}^k) \cdot \dim S_{[\...
- 553
6
votes
1
answer
131
views
Number of semistandard tableaux of all possible shapes fitting within some rectangle
Suppose $n$ and $k$ are two integers. Then I am interested in having a closed form for the sum
$$\sum_{\lambda \subset k \times n} S_\lambda (\mathbb{C}^n),$$
where $S_\lambda$ denotes the Schur ...
- 553
3
votes
0
answers
101
views
Tuple rearrangement: a combinatoric problem emerging from the Hurwitz action on Coxeter groups
I am working on Artin Groups, so called Dual Artin groups and the conjecture that they are isomorphic. Tuples of $n$ group elements can be acted on by the braid group $B_n$ in a particular way called ...
- 31
4
votes
0
answers
124
views
LIS-based permutation property
Let $S_n$ be the set of all permutations of $\{1, \ldots, n\}$, thereafter treated as integer sequences. Let $A_n$ be the set of all such permutations $\sigma \in S_n$ that we can choose two ...
- 5,590
3
votes
2
answers
303
views
Asymptotics of A000613
The general linear group $GL_n(\mathbb{F}_2)$ acts on the powerset $2^{{\mathbb{F}_2}^n \setminus \{0\}}$ by multiplication: $A \cdot S := \{Ax \in {\mathbb{F}_2}^n : \, x \in S\}$, for an invertible ...
- 331
3
votes
1
answer
153
views
Number of points covered by $2n$ hyperplanes in $\mathbf{F}_p^n$
For a prime $p$, fix two bases $U=\{v_1,\dots,v_n\}$ and $W=\{w_1,\dots,w_n\}$ of the vector space $V=\mathbf{F}_p^n$. We may assume $U$ is the standard basis without loss of generality.
For $s_1,\...
- 281
2
votes
1
answer
215
views
Number of binary matroids of rank $r$ on a ground set with $n$ elements
How many simple binary matroids are there, up to isomorphism, of rank $r$ on an $n$-element ground set, where $r \le n < 2^r$? Write this number as $a_r(n)$. Is there somewhere where I can get this ...
- 331
8
votes
0
answers
260
views
Efficient listing of ASMs
Famously, the alternating sign matrix theorem gives a product formula for the number $a(n)$ of ASMs of size $n$. There are multiple proofs of this formula, all somewhat involved. My question is ...
- 17k
0
votes
0
answers
95
views
Nested Set Permutations and their Enumeration
Let $(S_i)_{i \in \mathbb{N}}$ be a sequence of sets defined recursively as follows:
$S_1 = \{1\}$
$S_{i+1} = S_i \cup \{S_i, i+1\} \quad \forall i \in \mathbb{N}$
A permutation $\sigma$ of $S_i$ is ...
- 1
4
votes
1
answer
406
views
Inverse relationship between Stirling numbers of the first and second kind via generating functions
In combinatorics, a well-known result is that the matrix formed by the Stirling numbers of the second kind $\left(S(n,k)\right)_{n,k\geq 0}$ and the matrix of the signed Stirling numbers of the first ...
- 151
1
vote
0
answers
122
views
Monomial symmetric polynomials evaluation at roots of unity
The monomial symmetric polynomials are defined see Wikipedia.
For an arbitrary partition $\lambda$ with $n$ parts
I'm trying to find the following values:
$$m_{\lambda}(\omega_0,\dotsc,\omega_{n-1})$$
...
- 53
6
votes
2
answers
273
views
Counting a class of backtracking walks
We are interested in a class of walks on the complete graph on $[n] = \{1,2,\dots,n\}$. A walk of length $k$ is an ordered tuple of directed edges
$$
((i_1,i_2),(i_2,i_3),\ldots,(i_k,i_{k+1}))
$$
...
- 1,731
1
vote
1
answer
130
views
reference for a formula of the Motzkin triangle on OEIS
Motzkin triangles (OEIS A064189) $[T_{n,k}]$ are the Riordan arrays $(M(x),xM(x))$, where $(M(x))$ is the g.f. for the Motzkin numbers(OEIS A001006). The OEIS page shows that $$T_{n,k}=\frac{k}{n}\...
- 135
1
vote
1
answer
231
views
Looking for q-analog of derangement anagrams for a word
I have already known QPermutationDerangement:
It describes the distribution
$$
d_n(q)=\sum_{\sigma \in D_n} q^{\operatorname{maj}(\sigma)}
$$
Where we sum over all derangements of an $n$ element set.
...
- 175
5
votes
0
answers
307
views
On $s$-additive sequences
For a non-negative integer $s$, a strictly increasing sequence of positive integers $\{a_n\}$ is called $s$-additive if for $n>2s$, $a_n$ is the least integer exceeding $a_{n-1}$ which has ...
- 791
2
votes
1
answer
208
views
How many cap sets are there?
Most research on cap sets that I'm aware of focuses on the size of a cap set. Are there any results about the number of maximum-cardinality cap sets?
For example, it is known that in the game of SET, ...
- 82.6k
1
vote
1
answer
173
views
Some ideas about parking functions and integer partitions
We know that a integer partition of $\lambda=(\lambda_1, ..., \lambda_m)$ of $n$ satisfying $\lambda_1\geq \cdots \geq \lambda_m$ and $\sum_{i=1}^m\lambda_i=n$. Let $\mathcal{P}(n)$ be the set of ...
- 11
9
votes
2
answers
344
views
Counting $m\times n$ $\bigl({1\atop1}{1\atop0}\bigr)$-free $(0,1)$-matrices
Let $G_{m,n}$ denote the number of $m\times n$ $(0,1)$-matrices that avoid the submatrix $\bigl({1\atop1}{1\atop0}\bigr)$. (Submatrices need not be contiguous.) Here are some small values (not yet on ...
- 667
0
votes
1
answer
162
views
Formula for partitions of integers with no subpartition being a partition of $t$
When it comes to partitions, I know we can impose some modest restrictions (maybe even a couple) on the partitions and obtain counting formula, but I would like to impose some more serious constraints ...
- 23
5
votes
1
answer
228
views
Bijective proof for an identity concerning Stirling numbers of second kind
Let $\genfrac{\{}{\}}{0pt}{}{n}{k}$ the Stirling number of second kind, where $k$ is the number of parts in the partition.
If we take the identity that transforms the polynomial base $x^k$ into the ...
- 1,561
6
votes
3
answers
515
views
Applying $\sum_i \partial_{x_i}$, $\sum_i x_i \partial_{x_i}$ and $\sum_i x_i^2 \partial_{x_i}$ to Schur polynomials
The operators $L_k=\sum_i x_i^k\frac{\partial}{\partial x_i}$, with integer $k$, take symmetric polynomials into symmetric polynomials.
Is it known how to write the result of the application of $L_0$, ...
- 1,549
9
votes
0
answers
144
views
How many simplicial spheres with $n$ vertices and $N$ facets?
Let $s_d(n,N)$ be the number of different $d$-dimensional simplicial spheres on $n$ labelled vertices and $N$ facets (= $d$-simplices). I am in search for the best know upper bounds, especially for $d\...
- 13.6k
2
votes
0
answers
66
views
Combining (generalized) Polya enumeration with invariant properties
Let's say we want to enumerate maps $f$ between two finite sets $X$ and $Y$ modulo the action of groups $G$ on $X$ and $H$ on $Y$. Additionally we want $f$ to satisfy a certain property $P$ that is ...
- 34.3k
6
votes
0
answers
175
views
Combinatorial classes where not almost all objects are asymmetric
Let $\mathcal{C} = \bigcup_{n=0}^{\infty}\mathcal{C}_n$ be a class of finite (labeled) combinatorial objects, where $\mathcal{C}_n$ is the set of objects on $[n] = \{1,2,\dotsc,n\}$. For example, $\...
- 24.2k
1
vote
0
answers
73
views
Ordered combinatorial classes and partitions
Let $\mathcal{C}$ be a combinatorial class and let $\leq$ be a partial order on $\mathcal{C}$. We say that $(\mathcal{C},\leq)$ is an ordered combinatorial class if for all $x,y\in\mathcal{C}$, $$x&...
- 11
1
vote
2
answers
251
views
Estimation of a combinatoric formula
Assume $n\ge m$, what is the estimation of
$$\sum_{k_1+\dots +k_m\,=\,n,\\ k_1\ge 1,\,\dots,\,k_m\ge 1} C_n^{k_1,\dots,k_m} \left(\frac{1}{k_1}+\frac{1}{k_2}+\dots +\frac{1}{k_m} \right)$$
where $C_n^{...
- 185
3
votes
0
answers
171
views
Factorization of symmetric polynomials
Let $\Lambda_n$ be the algebra of all symmetric polynomials in $n$ variables, which we also consider as an infinite-dimensional vector $\mathbb{Q}$-space, whose basis is the Schur polynomials.
The ...
- 656
2
votes
0
answers
282
views
Distribution of peaks in Dyck paths
A Dyck word is a sequence of open and closed brackets such that the brackets come in correctly matched pairs. For example $(()(()))()$ is a Dyck word, while $())(()$ is not. A Dyck path is a visual ...
- 1,295
9
votes
0
answers
355
views
The $n$ queens problem with no three on a line
The $n$ queens problem asks if we can place $n$ queens on an $n\times n$ chessboard such that no two queens attack one another. For example, when $n=8$, here are two solutions (images taken from ...
- 667
2
votes
1
answer
320
views
Can you confirm the positivity of a quantity involving the Stirling numbers of the first kind
Let $s(m,n)$ denote the Stirling numbers of the first kind. For $m,n\in\mathbb{N}$, define
\begin{equation}
\mathcal{Q}(m,n)=(-1)^n\sum_{\ell=0}^{2n} \binom{m+\ell-1}{m-1} s(m+2n-1,m+\ell-1)\biggl(\...
- 1,091
7
votes
1
answer
503
views
Combinatorial consequences of de Branges's Theorem?
I'm usually not a proponent of the mentality “here is a tool, what results can we prove with it?” (as I prefer to start at the other end with a well-motivated problem), but this famously entertaining ...
- 191
3
votes
3
answers
756
views
Ordinary partitions vs partitions into odd parts
Let $\mathcal{P}(n)$ be the set of all unrestricted partitions of $n$ while $\mathcal{O}(n)$ stand for the set of all partitions of $n$ into odd parts. We adopt the power notation for partitions $\...
- 43.1k
6
votes
3
answers
526
views
Enumerating all inequivalent planar embeddings of a planar graph
Graph $G$ can be embedded (or has an embedding) in the space if $G$ can be drawn in the space if $G$ can be drawn in such a way that no two edges cross except at an end-vertex in common. A Graph $G$ ...
- 1,851
3
votes
0
answers
222
views
Number of partitions of set restricted by sum of square of part size
Let $p_1^{a_1}p_2^{a_2}\cdots$ denotes the integer partition of $n$, i.e. $a_1p_1+a_2p_2+\cdots=n$. Or equivalently $m_1+m_2+\cdots=n$. It is known that the number of partitions of set $\{x_1,x_2,\...
- 405
15
votes
2
answers
910
views
Sequences that don't count algebraic structures on finite sets
People count $n$-element groups, $n$-element monoids, $n$-element commutative monoids, etcetera - always up to isomorphism. The algebraic structures I've listed, and many more, are studied ...
- 22.2k
3
votes
0
answers
118
views
Divide Euclidean space by surfaces
It is well known that $n$ hyperplanes in $\mathbb{R}^k$ can divide $\mathbb{R}^k$ into at most $p$ regions where $p$ is
\begin{equation}
1 + n + C^2_n + \cdots + C^k_n
\end{equation}
Is there similar ...
- 185
0
votes
0
answers
170
views
Sum of square of parts, and sum of binomials over integer partition
Let $n$ be positive integer. Consider its integer partitions denoting as $(m_1,\cdots,m_k)$, where $m_1+\cdots+m_k=n$ and the order does not matter. We ignore the case of $(m_1,\cdots,m_k)=n$.
I am ...
- 405
7
votes
2
answers
328
views
The number of boolean function with given Fourier degree
How many boolean functions $\{-1,1\}^n \to \{-1,1\}$ with Fourier degree at most $d$?
By Fourier degree I mean the maximal cardinality of $S$ such that the Fourier coefficient $\hat{f}(S)$ is not ...
- 2,576
1
vote
0
answers
125
views
The number of boolean functions with given decision tree complexity
How many boolean function with $n$ variables with decision tree complexity $k$?
By decision tree complexity of a function $f$ I mean the smallest depth among all deterministic decision trees that ...
- 2,576
3
votes
1
answer
272
views
Enumerating possible number of satisfied linear equations
Consider a system of linear equations of variable $x=(x_1,\cdots,x_n)$ where each $x_i\in\{ 0,1,\cdots,L-1 \}$. Clearly, there are $\frac{n(n-1)}{2}$ number of equations in the system.
$$x_i-x_j=0, \ \...
- 405
0
votes
1
answer
346
views
A combinatorial proof: where art thou?
Start by introducing the finite sums
$$A_n:=\sum_{m=1}^nq^m\prod_{j=1}^{m-1}(1-q^j) \qquad \text{and} \qquad
B_n:=\sum_{m=1}^nq^m\prod_{j=m+1}^n(1-q^j).$$
An algebraic proof is facile: Clearly, $A_1=...
- 43.1k
4
votes
0
answers
211
views
Sum $f(n_1,n_2,\ldots,n_k) 1^{n_1} 2^{n_2} \ldots k^{n_k}$ over partitions
Use the notation $(n_1,n_2,\ldots,n_k) \vdash n$ to denote that $(n_1,n_2,\ldots,n_k)$ is a partition of the positive integer $n$, that is, $n_1+n_2+\ldots+n_k = n$ and $n_1 \ge n_2 \ge \ldots \ge n_k ...
- 261
14
votes
3
answers
1k
views
On the finite sum of reciprocal Fibonacci sequences
I want to check if $$\left\lfloor \left( \sum_{k=n}^{2n}{\frac{1}{F_{2k}}} \right)^{-1} \right\rfloor =F_{2n-1}~~(n\ge 3) \tag{$*$}$$ where $\lfloor x \rfloor$ is th floor function.
The Fibonacci ...
- 137
4
votes
2
answers
343
views
Number of partitions of $n$ and number of different integers in 1-avoiding partitions
Consider the number of integer partitions of $n$, usually denoted by $p(n)$ and generated by
$$\sum_{n\geq0}p(n)x^n=\prod_{k\geq1}\frac1{1-x^k}.$$
I have encountered an interesting enumeration.
Take ...
- 43.1k
7
votes
0
answers
220
views
Why are these two determinants equal?
This question is a follow up on Mark Wildon's comment from an earlier MO question.
As usual, let $(q)_k=(1-q)(1-q^2)\cdots(1-q^k)$ with $(q)_0:=1$. Also, define the Gaussian polynomials by
$$\binom{n}...
- 43.1k
4
votes
1
answer
197
views
On a double sum involving binomial coefficients
For natural $n$, let
\begin{equation}
p_n:=2^{1-n}\sum_{v=1}^l \binom l{(v+l)/2}1(v\equiv l)
\sum_{u=1-v}^{v-1}\binom k{(u+k)/2}1(u\equiv k), \tag{1}\label{1}
\end{equation}
where $k:=\lfloor(n+1)/...
- 128k
2
votes
1
answer
482
views
Counting $n$-edge directed graphs
I would like to count the $n$-edge directed graphs. The graphs might contain self-loops (edges connecting a vertex to itself) and multiple edges (multiple edges connecting the same pair of vertices). ...
- 21
2
votes
0
answers
79
views
Skewed plane partition with only row fillings reversed
The number of plane partitions in a bounded box is well-studied and dates back to MacMahon, at the start of this paper by Sam Hopkins and Tri Lai, p9, they summarized current results on the ...
- 51
4
votes
0
answers
97
views
"Convolving" a general Catalan with classical Catalan
Consider what is sometimes known as generalized Catalan sequence
$$\mathcal{{\color{red}C}}_{a,b}:=\frac{2b+1}{a+b+1}\binom{2a}{a+b}.$$
Observe that $\mathcal{{\color{red}C}}_{n,0}$ reduces to the ...
- 43.1k
1
vote
0
answers
77
views
Distribution of colour pairs from a random matching
Given $a$ many red balls and $b$ many blue balls, with $a+b$ even, suppose we chose a random matching between the $a+b$ balls. What is the distribution of the number of red-red and red-blue (and blue-...
- 129