Skip to main content

All Questions

3,203 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
10 votes
0 answers
408 views

Combinatorial results by Poincaré duality

For the n-dimensional Torus, the k-th homology group (with integer coefficients) is isomorphic to the direct sum of $n \choose k$ copies of $\mathbb{Z}$. Poincaré duality thus gives us a somewhat ...
10 votes
0 answers
1k views

Bound on the number of lattice points in d-dimensional ball

The following paper states that the number of lattice points in a $d$-dimensional ball of radius $R$ is $V_d R^d + O(R^\alpha)$ where $\alpha = d - 2$ and $V_d$ is the volume of the unit $d$-...
Guy's user avatar
  • 201
10 votes
0 answers
365 views

diameter as a Morse function

Consider the space $X_1$ of closed subsets not containing a pair of antipodal points of the unit circle. Here we have a kind of degenerate Morse function, defined by the diameter of the pointset. ...
Mikhail Katz's user avatar
  • 16.6k
10 votes
0 answers
669 views

Minimum spanning tree of a random graph

Consider $n$ points arbitrarily located on the plane. Consider a random graph $G$ drawn from $G(n, \frac12)$ on these points (i.e. the Erdos-Renyi random graph where every edge is selected with ...
Pradipta's user avatar
  • 501
10 votes
0 answers
378 views

Another combinatorial question about cyclic words

Here is a more general (and possibly more clearly stated) combinatorial version of this question, than this question. Let $u$ be a sequence of 0 and 1 of length $n$. Let $p,q,r$ be three natural ...
user avatar
10 votes
0 answers
494 views

Kruskal-Katona type question for union-closed families of sets

Question: Let $n,k$ be two positive integers with $n \geq k$. Let $\mathcal{F}$ be a family of $C(n,k)$ sets, each of size $k$, and let $\langle\mathcal{F}\rangle$ denote the union-closed family ...
Peter Hegarty's user avatar
10 votes
0 answers
302 views

Are plactic classes convex under the right weak Bruhat order?

For those who are unfamiliar with the terminology, I'll explain a little. The symmetric group $S_n$, as a type A Coxeter group, has generators $\{s_1,\ldots,s_{n-1}\}$ with relations (1) $s_i^2$ for ...
Kurt Luoto's user avatar
10 votes
0 answers
191 views

What is known about the number of permissible simplicial complexes given the number of k-cells?

Motivation: I am working on a problem that reduces to finding simplicial complexes given some data (details are unnecessary), but all I have managed to wrangle from my input is the number of cells of ...
Ketil Tveiten's user avatar
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 ...
M. Winter's user avatar
  • 13.6k
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.$$ ...
Anurag Sahay's user avatar
  • 1,354
9 votes
0 answers
258 views

On a continued fraction and vector $\nu$ of length $n$

Please note that this question has been completely reworked in order not to overload it with unnecessary and useless information. Let $f(n)$ be an arbitrary function with integer values. Let $a(n)$ ...
Notamathematician's user avatar
9 votes
0 answers
212 views

Left adjoint functor between categories of polygons?

EDIT: Based on very helpful comments from Alec Rhea and Qiaochu Yuan I am adding some specification on objects and morphisms, hoping that this clarifies the idea behind these categories. I have also ...
Claus's user avatar
  • 6,917
9 votes
0 answers
177 views

An $m$-positivity conjecture related to bivariate Jacobi-Trudi matrices

This question by Rellek reminds me of the following problem. Alan Sokal has conjectured that if we replace the elementary symmetric function $e_k$ in the dual Jacobi-Trudi matrix for $s_\lambda$ (a ...
Richard Stanley's user avatar
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\...
M. Winter's user avatar
  • 13.6k
9 votes
0 answers
179 views

Are there fast rank and unrank algorithms for integer vectors under the action of a permutation group?

We are distributing $m$ indistinguishable balls in $k$ numbered boxes $S=\{1,2,\ldots,k\}$. A distribution is a tuple of nonnegative integers $a=(a_1,\ldots,a_k)$ whose sum is $m$. We also have a ...
Jukka Kohonen's user avatar
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 ...
ho boon suan's user avatar
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 ...
Luis Ferroni's user avatar
  • 1,889
9 votes
0 answers
242 views

Combinatorial interpretation of recurrence relation for Narayana numbers

The Narayana numbers defined by $N_{n,k}=\frac{1}{k+1}\binom{n}{k} \binom{n+1}{k},$ for $n\geq0,$ $0\leq k \leq n,$ and $N_{n.k}=0$ else, can be constructed recursively via the recurrence $$\binom{n+...
Johann Cigler's user avatar
9 votes
0 answers
355 views

Goldberg-Seymour conjecture

I am wondering whether the graph theory community regards the Goldberg-Seymour conjecture as settled. According to the Wikipedia entry on the Goldberg-Seymour conjecture, "In 2019, an alleged ...
James Propp's user avatar
  • 19.7k
9 votes
0 answers
265 views

If $A+A+A$ contains the extremes, does it contain the middle?

Let $b \ge 1$ and $A\subseteq [0,b]$ be a set of integers (all intervals will be of integers). Write $hA := \underbrace{A + \ldots + A}_{h\text{ summands}} = \{ \sum_{i=1}^h a_i ~|~a_i \in A,\, \...
Alufat's user avatar
  • 825
9 votes
0 answers
161 views

Number of tautologies of a given size?

Fix some complete set of $L$ logical connectives such as $\{ \wedge, \neg \}, \{\Rightarrow, \neg \}, \{\ \vee, \wedge, \neg \}, \{ \uparrow\}, \{\wedge, \vee, \neg, \Rightarrow \}$ - I'll assume all ...
Sprotte's user avatar
  • 1,075
9 votes
0 answers
409 views

Number of sets $S$ for which number of permutations in $S_n$ with descent set $S$ is odd

The descent set $D(w)$ of a permutation $w=a_1 a_2\cdots a_n\in\frak{S}_n$ is defined by $D(w)=\{ 1\leq i\leq n-1\,:\, a_i>a_{i+1}\}$. Given a set $S$, let $\beta_n(S)$ denote the number of ...
Richard Stanley's user avatar
9 votes
0 answers
378 views

How many orthogonal matrices (not orthonormal) are there with entries in $\{0,1,−1\}$?

Here by orthogonal matrix I mean just the rows are mutually orthogonal. Two such matrices are equivalent if one can be obtained from the other by permutations of rows and columns, or change of signs ...
Arun 's user avatar
  • 745
9 votes
0 answers
358 views

Being even or odd in the product expansion $\prod(1+x^k+x^{k+1})$

Consider the generating function of "partitions with distinct parts" $$\sum_nQ(n)x^n=\prod_k(1+x^k).$$ It's known that $$\left[\prod_k(1+x^k)\right] \mod 2=\prod_m(1-x^m)=\sum_{j\in\mathbb{Z}...
T. Amdeberhan's user avatar
9 votes
0 answers
487 views

Two majs for standard Young tableaux?

Let $\lambda$ be a partition of $n$, and consider its set of standard Young tableaux (SYTs): bijective fillings of the Young diagram of $\lambda$, written in English notation, with the numbers $1$ ...
Sam Hopkins's user avatar
  • 24.2k
9 votes
0 answers
467 views

Measuring the randomness of texts

The question concerns statistic properties of random words in a finite alphabet $A$. By $A^{<\omega}$ we denote the set of all words in the alphabet $A$, i.e. finite sequences of elements of $A$. ...
Taras Banakh's user avatar
  • 41.8k
9 votes
0 answers
359 views

Factorisation of a polynomial from the Boolean algebra

Let $B_n$ denote the Boolean algebra of a set with $n \geq 2$ elements and $C_n$ the matrix with entries $c_{i,j}=1$ if $i \leq j$ and $c_{i,j}=0$ else, where $i,j\in B_n$. Let $M_n:=C_n+C_n^T$ and $...
Mare's user avatar
  • 26.5k
9 votes
0 answers
361 views

Bernoulli-like polynomials

Let $\psi_0 (x,t)=\frac{te^{xt}}{1-e^{-t}}$. Then $$\psi_0(0,t)=\frac{t}{1-e^{-t}};$$ $$\psi_0(x,t)=1+\sum_{n=1}^\infty \frac{t^n}{n!} B_n(x)$$ where $B_n$ is a monic polynomial of degree $n.$ Now ...
Boris Tsygan's user avatar
9 votes
1 answer
1k views

Bounding the probability that two binomials are equal

Note: This question was migrated from this earlier post, where it initially appeared. Following suggestions, I moved this into its own question. Let $B_{n,p}$ denote the usual binomial random ...
Pat Devlin's user avatar
  • 2,720
9 votes
0 answers
336 views

Possible oversight in paper of Greene and Kleitman on chains in dominance order on partitions?

This question is about a possible lacuna in a paper of Greene and Kleitman which Zarathustra Brady made me aware of. The paper in question is "Longest Chains in the Lattice of Integer Partitions ...
Sam Hopkins's user avatar
  • 24.2k
9 votes
0 answers
225 views

On the first sequence without collinear triple

Let $u_n$ be the sequence lexicographically first among the sequences of nonnegative integers with graphs without collinear three points (as for $a_n=n^2$ or $b_n=2^n$). It is a variation of that one. ...
Sebastien Palcoux's user avatar
9 votes
0 answers
270 views

The number of non-singular $n\times n$ matrices over $\mathbb{F}_2$ with exactly $k$ non-zero entries

Suppose $M_{n}^{k}$ is the number of non-singular $n\times n$ matrices over $\mathbb{F}_2$, that have exactly $k$ non-zero entries. Is there some sort of formula to calculate $M_n^k$? If $k < n$ ...
Chain Markov's user avatar
  • 2,618
9 votes
0 answers
2k views

Exactly Counting the Number of Lattice Points in an $n$-Dimensional Sphere

Let $S_n(R)$ denote the number of lattice points in an $n$-dimensional "sphere" with radius $R$. For clarification, I am interested in lattice points found both strictly inside the sphere, and on its ...
MC From Scratch's user avatar
9 votes
0 answers
304 views

Symmetric function transition matrix and a non-conjecture by Clifford and Stanley

Consider the transition matrix $R = \left(R_{\lambda,\mu}\right)$, defined by $$ p_\lambda = \sum_{\mu} R_{\lambda\mu}m_\mu , $$ between the power-sum and the monomial basis of the ring of symmetric ...
Per Alexandersson's user avatar
9 votes
0 answers
156 views

Minimal number of colours in distinguishing colouring of biconnected graphs

A colouring of edges of a graph is distingushing if no non-identity automorphism of the graph preserves this colouring. Problem. Is it true that each biconnected graph possesses a distinguishing ...
Lviv Scottish Book's user avatar
9 votes
0 answers
327 views

Why does Loday call the permutohedra "zylchgons"?

Today I was reading Jean-Louis Loday's classic paper, "Realization of the Stasheff polytope", in which he produces a simple and very pretty realization of the associahedra as convex polytopes. He ...
Nathaniel Bottman's user avatar
9 votes
0 answers
180 views

Infinite series identities in search of a proof

This comes in relation to the Fishburn numbers. I stumbled on the following relation for which I ask a proof if true. Let $Q_i(z):=1-(1-t)^{i-1}(1-zt)$. Then $$\sum_{n=0}^{\infty}\frac{(n+1)zt}{...
T. Amdeberhan's user avatar
9 votes
0 answers
192 views

For $q$-analogues of a known curious identity

In 2002 I published the folllowing curious combinatorial identity: $$(x+m+1)\sum_{i=0}^m(-1)^i\binom{x+y+i}{m-i}\binom{y+2i}i-\sum_{i=0}^m\binom{x+i}{m-i}(-4)^i=(x-m)\binom xm.$$ My original proof is ...
Zhi-Wei Sun's user avatar
  • 15.6k
9 votes
0 answers
247 views

Covering inequality for sets of intervals

Let $I$ and $J$ be finite sets of open intervals $(a,b)\subset\mathbb R$. For a finite set of points $P\subset \mathbb R$ we denote those subsets of intervals from $I$ and $J$ containing some point ...
Julian's user avatar
  • 623
9 votes
0 answers
186 views

Interactions between pseudoline arrangements and braid groups?

It is common to represent pseudoline arrangements as wiring diagrams:                     Fig. from: "Hamiltonicity and colorings of arrangement ...
Joseph O'Rourke's user avatar
9 votes
0 answers
365 views

How to count integer lattice points close to a subspace of $\mathbb R^n$?

Consider $m$ linearly independent vectors in $n$-dimensional Euclidean space, $v_1,...,v_m \in \mathbb R^n$ where $1\leq m<n$, and let $U := {\rm span}(v_1,...,v_m)$ denote the $m$-dimensional ...
Dierk Bormann's user avatar
9 votes
0 answers
534 views

Generating $S_n$ with a fundamental transposition and a big cycle

I apologize in advance if this is too amateur, this is not really my area, but I'm very curious. We have a permutation $\pi \in S_n$ and we want to represent it as a product of $\sigma = (1\;2)$ and $...
Artur Riazanov's user avatar
9 votes
0 answers
245 views

Almost blocking sets in $\mathbb F_q^2$

$\newcommand{\F}{{\mathbb F}}$ Let $q$ be an odd prime power. A blocking set in the affine plane $\F_q^2$ is a set blocking (meeting) every line. A union of two non-parallel lines is a blocking set ...
Seva's user avatar
  • 23k
9 votes
0 answers
213 views

Some quotients of Hankel determinants

This question has been inspired by Hankel determinants of binomial coefficients. For a sequence $\{h_{n}\}_{n=0}^{\infty}$ denote by $H_n$ the Hankel matrix $$H_{n}:=\begin{pmatrix} h_{0} & h_{...
Johann Cigler's user avatar
9 votes
0 answers
175 views

How many components are there in the space of "generic" planar N-gons? (Mnev's revenge)

Call an ordered $N$-tuple of points in the Euclidean plane ${\mathbb R} ^2$ "in general position" if no three points of the points in the set are collinear. As a function of $N$ how many components ...
Richard Montgomery's user avatar
9 votes
0 answers
193 views

Littlewood-Richardson sequences and Littlewood-Richardson coefficients

I'm looking for a proof or a reference for the following statement, I give the definitions below: There exists a Littlewood-Richardson sequence of type $(\alpha, \beta, \lambda)$ if and only if $...
Maffred's user avatar
  • 291
9 votes
0 answers
397 views

When do almost all these invariants of tensors vanish?

Let $A,B,C,D$ be $n$-dimensional vector spaces over a field $k$. There is a natural homomorphism from the $mn^m$th tensor power $A^{\otimes (m n^m)} $ of $A$ to $k$ given by the determinant map $A^{\...
Will Sawin's user avatar
  • 148k
9 votes
0 answers
275 views

pattern-avoiding permutations vs multi-core partitions

Let $\mathfrak{S}_n$ be the permutation group on $[n]$. Given the pattern $\sigma=k(k-1)\cdots321$, let $I_n(\sigma)$ be the number of involutions in $\mathfrak{S}_n$ that avoid the pattern $\sigma$. ...
T. Amdeberhan's user avatar
9 votes
0 answers
209 views

Generating functions of real-rooted polynomials

Suppose $f_n(t)$ is a degree $n$ polynomial. Let $F(t,u) = \sum_n f_n(t)u^n$. What conditions on $F(t,u)$ tell us that the $f_n(t)$ are real-rooted? Similarly, are there any conditions on $F(t,u)$ ...
Katie Gedeon's user avatar
9 votes
0 answers
204 views

Positivity of coefficients of Ehrhart polynomial of n-Tetrahedron

A set of positive integers $d_1, \dots, d_n$ describe two n-dimensional closed lattice tetrahedron: $$ T = \left\{ (x_1, \dots, x_n) \in \mathbb{R}^n: \sum_{i=1}^n \frac{x_i}{d_i} \leq 1 \textrm{ and ...
Jiro's user avatar
  • 909

1
3 4
5
6 7
65