All Questions
Tagged with combinatorics or co.combinatorics
11,023 questions
0
votes
0
answers
34
views
separator and vertex-connectivity
A definition of "separator" is the following: Let $G$ is an $n$-vertex graph, then $S\subseteq V(G)$ is a separator if there is a partition $V=A\cup B\cup S$ such that $|A|,|B|\le 2n/3$ and ...
- 281
56
votes
1
answer
3k
views
Intersecting family of triangulations
Let $\cal T_n$ be the family of all triangulations on an $n$-gon using $(n-3)$ non-intersecting diagonals. The number of triangulations in $\cal T_n$ is $C_{n-2}$ the $(n-2)$th Catalan number. Let $\...
- 24.7k
2
votes
0
answers
90
views
Conjugacy between piecewise linear circle maps
Let $\mathcal{M}$ the Mandelbrot set,
$\mathcal{M}=\{c \in \mathbb{C}: \{Q_c^n(0) \}_{n \in \mathbb{N}} \text{ is bounded, where } Q_c(z)=z^2+c \}$
And let the hyperbolic or stable component, $H_n=\{ ...
- 271
0
votes
1
answer
128
views
Closed form for $\sum\limits_{k=0}^{n} [\operatorname{wt}(k) = m]$ where $\operatorname{wt}(n)$ is the binary weight of $n$
Let $\operatorname{wt}(n)$ be A000120 (i.e., number of $1$'s in binary expansion of $n$).
Let $a(n,m)$ be the family of integer sequences such that
$$
a(n,m) = \sum\limits_{k=0}^{n} [\operatorname{wt}(...
- 7,226
5
votes
0
answers
363
views
A Collatz-like map?
Consider the map $\psi$ acting on triples $(a\leq b\leq c)$ of three positive natural integers with $\mathrm{gcd}(a,b,c)=1$ as follows:
Set $$(a',b',c')=\left(\frac{a}{\mathrm{gcd}(a,bc)},\frac{b}{\...
- 17.9k
8
votes
1
answer
668
views
Infinite series and sum of two squares
Consider the following infinite sequence $a(n)$ generated by
$$\sum_{n\geq0} a(n)q^n
=\frac{\sum_{k\geq0}F(2k+1)q^{\binom{k+1}2}}{\sum_{k\geq0} q^{\binom{k+1}2}}$$
where the $F(2k+1)$ are the odd ...
- 79.9k
7
votes
1
answer
343
views
Can the corollary of the Ihara–Bass formula be extended to $ u^2 = 1 $?
Suppose there is a finite undirected graph $G(V,E)$ having $n$ vertices and $m$ edges.
The non-backtracking matrix $B$ is indexed by $2m$ directed edges and defined as
$$
B(a \to b, c \to d) = \delta_{...
- 6,367
0
votes
0
answers
85
views
How to prove the following equation (involving multiple binomial coefficients sum)?
I encountered the equation below, encountered a problem that has been bothering me for a long time
Does anyone have an idea how to prove it? I would be extremely grateful to you if you come up with an ...
- 41
15
votes
3
answers
4k
views
How to place k bishops on an nxn chessboard
In how many different ways can k bishops be placed on an nxn chessboard such that no two bishops attack each other? Please try to respond with a formula and explanation.
- 41
3
votes
1
answer
405
views
Moments of a random variable related to uniform distribution on sphere
Let $u$ be taken uniformly from the unit sphere $\mathbb S^{n-1}$ and $D$ be a diagonal matrix. I'd like to find a general formula for
$$
\mathbb E[(u^\top D u)^m]
$$
for $m=1,2,3, \dots$, in terms of ...
- 188k
1
vote
1
answer
80
views
What are the efficient algorithms to compute Hamiltonian paths on Cayley graphs of finite groups ? Can GAP do it?
The famous Lovasz conjecture predicts existence of the Hamiltonian path on Cayley graphs. In general finding such a path is NP-complete problem, but there are many heuristic algorithms.
Question 1: ...
- 12.7k
3
votes
0
answers
81
views
Combinatorial/probabilistic interpretation of a quantity of union closed family
Let $\mathcal{F}\subseteq2^{[n]}$ be a union-closed family of sets. For a set $S\in[n]$ (not necessary belong to $\mathcal{F}$), define $w_{\mathcal{F}}(S)$ to be the number of subset of $S$ which ...
- 32.5k
3
votes
1
answer
192
views
Density of Pisot polynomials
Recall that a Pisot polynomial $P=x^n+ a_{n-1}x^{n-1}\ldots a_1$ has integer coefficients, a real root $x_1>1$ and all other roots $|x_i|<1$ for $1\leq i \leq n$. One key result is that $\{(...
- 1,043
8
votes
1
answer
534
views
The cars problem, again
Consider the following simple problem: We are given $2n$ parking spots, labelled from 0 to $2n-1$. There are $n$ cars on the first $n$ spots, and the remaining $n$ spots are free. At every step, every ...
9
votes
1
answer
788
views
Sequence of real-rooted polynomials
I've been interested in proving a log-concavity result via proving that certain family of polynomials is real-rooted. By performing a sequence of transformations, I can reduce that problem to proving ...
CommunityBot
- 1
4
votes
0
answers
81
views
Classification of nilpotent orbits over local fields (for type ABCD via partitions )
Let $\mathfrak g$ be a simple Lie algebra over a char $0$ local field $F$ (e.g. $F=\mathbb R$ or $F=\mathbb Q_p$) with its adjoint group $G$. Let $\mathcal N \subseteq \mathfrak g$ be its nilpotent ...
- 6,622
0
votes
0
answers
78
views
Solution modulo $9$ of certain linear equation implies triviality modulo $3$
Question: Let $k \geq 2$ and $r \geq 4$ be two natural numbers. We are given eight integers $\nu_{ij} \geq 0$ for every $1 \leq i \leq k$ and $1 \leq j \leq r$ such that the following two conditions ...
- 119
0
votes
1
answer
168
views
Partial sums of binomial coefficients and related family of polynomials
Let $a(n)$ be A302117. Here
$$
a(n) = 4(n-1)a(n-1) - \frac{1}{3}\prod\limits_{k=0}^{n-1}(2k-3), \\
a(0) = 0.
$$
Let
$$
T(n,k) = \sum\limits_{i=0}^{k} \binom{n}{i}.
$$
Let $P_n(z)$ be the family of ...
- 34.3k
12
votes
1
answer
2k
views
Hobbled rook tour – Hamiltonian cycle on square grid
Consider a square grid of even side length ($2n \times 2n$). It is easy to see that there must exist a Hamiltonian cycle on the corresponding grid graph. Such a cycle is called balanced if the number ...
CommunityBot
- 1
1
vote
0
answers
149
views
Inequalities in the classic proof of perfect matching in Erdős–Rényi graph
I am checking the classic paper by Erdős and Rényi, "On the existence of a factor of degree one of a connected random graph" with the link here. I am curious about the computation of the ...
- 97
2
votes
0
answers
84
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_{[\...
- 12.9k
5
votes
0
answers
216
views
Are there Sudoku variants which are useful or mathematically deep?
I was recently watching a Sudoku Youtube channel which shows a large number of variants on the traditional Sudoku puzzle, some of them non-trivial to solve. I think there was some mention of a Sudoku ...
- 12.9k
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 ...
- 24.2k
2
votes
1
answer
319
views
Why are graph embeddings defined the way they are?
In my recent question I asked about a proof for the fact that the dual of a dual graph embedding is equal to the original graph. Thinking about this a little more leads me to wonder why graph ...
- 32.1k
1
vote
1
answer
196
views
Probability distribution on Python-dictionary-like objects?
I would like to examine information-theoretical properties of random variables that take as values objects which are akin to dictionaries in the Python programing language.
That is, each sample of the ...
CommunityBot
- 1
0
votes
2
answers
99
views
Is there an uncountable extension of the Ramsey set $[\omega]^2$?
We say that a family ${\cal A}\subseteq {\cal P}(\omega)$ is Ramsey
if for every map $c:{\cal A}\to\{0,1\}$ there is an infinite set $X\subseteq \omega$
with the following properties:
${\cal A}\cap {\...
- 13.4k
4
votes
1
answer
197
views
Solving a three-parameter recursive sequence
Consider the triple-indexed sequence of integers defined by
\begin{align} \label{coefficientsV} \nonumber
f(\alpha,\beta,\gamma)
&:=(2\alpha+8\beta+12\gamma-1)\cdot f(\alpha-1,\beta,\gamma)...
- 3,671
9
votes
0
answers
292
views
Tilings in finite (not necessarily Abelian) groups
Let $G$ be a finite (not necessarily abelian) group. We call $A \subseteq G$ a right-tiling (for simplicity, a tiling) of $G$ if there exists a $B \subseteq G$ so that
$$ G = \bigsqcup_{b\in B} bA.$$
...
- 1,354
0
votes
0
answers
95
views
Class multiplication coefficients of symmetric groups
My question is that I was working with some counting problems, and finally the answer should be
$$
\nu_{\mu_1,\mu_2,\mu_3}=\#\{(\sigma_1,\sigma_2,\sigma_3): \sigma_1\sigma_2\sigma_3=1, \sigma_1\in C_{\...
- 63.9k
5
votes
1
answer
344
views
Are parabolic Kazhdan-Lusztig polynomials truncations of the usual Kazhdan-Lusztig polynomials?
Let $(W,S)$ be the affine Weyl group associated to a simple root system.
For $x,y \in W$ we have the usual Kazhdan--Lustig polynomials $h_{y,x} \in \mathbb{Z}[v]$ in Soergel's normalisation, and if ...
- 10.5k
8
votes
1
answer
1k
views
GAP cannot solve Rubik's cube 4x4x4 and higher ? (Practical limits of Schreier–Sims algorithm)
According to our practical experiments and literature search - computer algebra system GAP cannot "solve" Rubik's cube 4x4x4 and higher. That means cannot decompose given random element of ...
- 5,654
9
votes
0
answers
144
views
Which polytopes have compact realization spaces?
Let $P\subset\Bbb R^d$ be a convex polytope.
Its reduced realization space is the space of all combinatorially equivalent polytopes modulo projective transformations.
I am interested in polytopes for ...
- 13.6k
6
votes
1
answer
243
views
Is it possible that the number of $\mathcal{T}$-algebras is an arithmetic progression?
For a single-sorted algebraic theory $\mathcal{T}$ denote by $t_n$ the number of $\mathcal{T}$-algebras with $n$ elements (up to isomorphism). Is there an example for $\mathcal{T}$ such that ...
- 14.6k
1
vote
0
answers
57
views
Step back step forward algorithm for A108442
Let $a(n)$ be A108442. Here generating function is $\frac{1}{1-zA(z)}$ where
$$
A(z) = 1 + z(A(z))^2 + z(A(z))^3.
$$
Also
$$
a(n) = \sum\limits_{k=1}^{n}\frac{k}{2n-k}\sum\limits_{i=0}^{n-k} \binom{2n-...
- 4,928
2
votes
1
answer
111
views
Is there a ternary Cayley graph on 27 vertices that is a non-complete core?
Is there a non-complete ternary Cayley graph that is a core with $3^3 = 27$ vertices?
By a ternary Cayley graph, I mean a (simple, undirected) graph whose vertex set is $\mathbb{Z}_3^n := \bigoplus_{i ...
- 12.7k
5
votes
1
answer
383
views
Shortest polygonal chain with $6$ edges visiting all the vertices of a cube
I am trying to find which is the minimum total Euclidean length of all the edges of a minimum-link polygonal chain joining the $8$ vertices of a given cube, located in the Euclidean space. In detail, ...
CommunityBot
- 1
2
votes
0
answers
182
views
Algorithm for $\frac{1}{1-x} = \sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n}\frac{1-kx}{1+kx}$
Let $a(n)$ be A208832. Here
$$
\frac{1}{1-x} = \sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n}\frac{1-kx}{1+kx}.
$$
Start with vector $\nu$ of fixed length $m$ with elements $\nu_i = 1$ (that ...
- 175
2
votes
1
answer
189
views
Tighter lower bound of the lower triangular sum of an arbitrary Latin square
In this math.stackexchange.com question I seek a tighter bound than the one I presented in there in the question. Rob Pratt puts forth a conjecture in his answer motivated by the dual problem of the ...
CommunityBot
- 1
1
vote
1
answer
178
views
Inside-out dissections of solids -2
We record some general questions based on
Inside-out dissections of solids
Inside-out dissections of a cube
Can every convex polyhedral solid be inside-out dissected to a congruent polyhedral solid?...
- 5,979
11
votes
1
answer
427
views
Graph chromatic numbers defined by interactive proof
Edit (2020-07-15): Since the discussion below is perhaps a bit long, let me condense my question to the following
Short form of the question: Let $G$ be a finite graph (undirected and without self-...
0
votes
2
answers
115
views
Upper bounds on quotients of binomial coefficients
Let $\gamma>1$ be a real number and let $n\in \mathbb{N}$.
Define $f\colon\mathbb{N}\to[0,1]$
$$
f(n_0) = \frac{\binom{n-n_0}{m}}{\binom{n}{m}},
$$
where
$$
m = \Big\lfloor{\frac{n}{\lceil\gamma ...
- 128k
4
votes
1
answer
304
views
Minimum eigenvalue of a symmetric matrix
I was solving a problem and got stuck on the following:
Let $[p] = \{1, \ldots, p\}$ where $p \in \mathbb{N}$. Let $P(n, r)$ denote the set of all injective functions from $[r]$ to $[n]$ and write a ...
- 256
14
votes
1
answer
606
views
Is there an elementary proof of a better result for the finite guessing-box puzzle?
The infinitary guessing-box puzzle is amazing — see here. In the basic form, the Guessing-box Hall has infinitely many wooden boxes, each containing a real number, and there are 100 mathematicians ...
- 4,316
0
votes
1
answer
160
views
The generating series of the weighted species of fixpoints
I am wondering if the series
$$\sum_{n=0}^\infty \left(\sum_{k=0}^n \frac{D_{n-k}}{k!(n-k)!}t^k\right)X^n$$
where $D_m$ is the number of derangements of $m$ letters, admits a representation in closed ...
CommunityBot
- 1
8
votes
1
answer
255
views
Maximal Ramsey families
We say that a family $\mathcal R\subseteq \mathcal P(\omega)$ is Ramsey if
$\bigcup \mathcal R = \omega$, and
for every map $f:\mathcal R \to \{0,1\}$ there is an infinite set $X\subseteq \omega$
...
- 12.9k
-3
votes
1
answer
73
views
Non-Ramsey function $f:[\omega]^{<\omega}\to\{0,1\}$ [closed]
Let $\newcommand{\o}{\omega}\o$ be the set of non-negative integers, and for any set $X$, let $\newcommand{\oo}{[\o]^{<\o}}X^{<\o}$ denote the collection of all finite subsets of $X$.
What is an ...
- 5,040
1
vote
0
answers
161
views
Efficient algorithm for A217061
Let $a(n)$ be A217061. Here
$$
a(n) = \sum\limits_{m=1}^{n}\frac{1}{(m-1)!}\sum\limits_{k=0}^{n-m}(n+k-1)!\sum\limits_{j=0}^{k}\frac{1}{(k-j)!}\sum\limits_{\ell=0}^{j}\frac{2^{\ell-j}(-1)^{\ell+j}s(n-...
- 4,928
11
votes
2
answers
386
views
Bounds for the difference in the number of ones in $M$ and $M^{-1}$
If $M$ is a full rank $n$ by $n$ binary matrix over $\mathbb{F}_2$, how much larger or smaller can the number of $1$s in $M^{-1}$ be, compared to the number of $1$s in $M$?
Clearly the identity matrix ...
- 109k
1
vote
1
answer
99
views
Is there any known upper bound for the local crossing number of a graph drawing in the plane?
The local crossing number ${\rm LCR(G)}$ of a graph $G$ is defined as the least nonnegative integer $k$ such that the graph has a $k$-planar drawing. In other words, it is the smallest possible number ...
- 21
1
vote
1
answer
73
views
"Gray code" for $[\omega]^{<\omega}$
Let $\newcommand{\oo}{[\omega]^{<\omega}}\oo$ denote the collection of finite subsets of the set of non-negative integers $\newcommand{\o}{\omega}\o$.
If $A,B$ are any sets, let $A \,\triangle \, B ...
- 24.2k