Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

learn more… | top users | synonyms (1)

11
votes
2answers
255 views

Set system with different differences

What is the maximal number of sets in a set system $\mathcal{A}$ of subsets of an $n$ element set such that for every $i \neq j $ and $A_i,A_j \in \mathcal{A}$ the difference $A_i \setminus A_j$ is ...
3
votes
0answers
149 views

To what extent is it possible to generalise a natural bijection between trees and $7$-tuples of trees, suggested by divergent series?

This is a cross-post from MSE. In the paper "Seven Trees In One" by Andreas Blass, a "very explicit" bijection is found between trees and 7-tuples of such trees. The idea to construct such a ...
3
votes
1answer
179 views

d-regular partitions and permutations

A $d$-regular partition is a partition of an $n$ element set with the additional restriction that $x,y$ with $|x-y|<d$ cannot be in the same block. So, if $d=2$, say, then the partition ...
5
votes
1answer
234 views

Parking Functions and the Binomial Theorem

Cross-post from http://math.stackexchange.com/questions/808490/parking-functions-and-the-binomial-theorem A parking function is a function $f: \{1, \ldots n\} \rightarrow \{1, \ldots n\}$ which has ...
2
votes
0answers
202 views

Hook Content Formula: Has anyone seen this proof?

Below is the outline of a proof idea I have for the Hook Content Formula. I'm wondering whether anyone is aware of whether this technique has been used before, and if so, if they could give me a ...
8
votes
2answers
326 views

Sum and product estimate over integers, rationals, and reals

My question is the following: is finding a lower bound for $|A+A\cdot A|$ (as a function of $|A|$) where $A$ is any finite subset of the positive integers equivalent to finding the same lower bound ...
11
votes
1answer
571 views

Colourings of $\mathbb Q\times \mathbb Q$ in three colours

Using two-adic valuation Monsky coloured $\mathbb Q\times \mathbb Q$ in red, blue, and green, so that on each line points of at most two colours are present. Question. I would like to know if there ...
1
vote
1answer
161 views

How is this combinatorial structure called?

Here is a "colourful" description of what I would like to count. Suppose you have one of those tables you see in a casino. I think they are for roulette, with $m$ squares, each of them with a number ...
5
votes
1answer
212 views

“strongly mixing” action on dimers?

In Local Statistics of Lattice Dimers we study a nice familiar object, domino tilings in the plane extending out to infinity. His paper is going to discuss the frequency of various "motifs" in ...
8
votes
1answer
161 views

Spectral lower bounds on the diameter of a graph

There is such a bound, due to Mohar and McKay, using the second-smallest eigenvalue of the Laplacian $\lambda_{2}$: $$Diam \geq \lceil \frac{4}{n\lambda_{2}} \rceil.$$ This bound is very elegant but ...
0
votes
0answers
79 views

Resources about integral maximization problem

I am looking at the following problem. Given an interval I, and a function f over that interval, find sub-intervals for which: The sum of the length of the sub-intervals is < k; The sub-intervals ...
3
votes
1answer
182 views

Why complete symmetric polynomials and elementary symmetric polynomials are dual to each other?

Here the definition of complete symmetric polynomial $h_{k}$ and elementary symmetric polynomial $e_{k}$ are: $$ e_{k}=\sum_{1\le i_1<\cdots <i_k\le n}x_{i_1}\cdots x_{i_k}, h_{k}=\sum_{1\le ...
1
vote
1answer
115 views

Name search for special Linear Integer Program

I am looking for a name for the following question in literature! (and if you know it, then it would be great) I couldn't find it and due to wide audience here, presumably you know more. Thank you ...
4
votes
3answers
282 views

Counting chains of inclusions

Let $g(n,k)$ be the number of chains $$ A_k \subset A_{k-1} \subset\dots\subset A_1 \subset A_0 $$ of $k$ proper subset inclusions, where $A_k\neq\emptyset$ and $A_0$ is a standard $n$-element set. ...
2
votes
1answer
166 views

Combinatorial sum (Author and generalization?)

In a book I have met one interesting equation (without reference): $$\frac{m!}{n!}\sum_{i=0}^n(-1)^i{n\choose{i}}{x+m+n-i\choose{m}}=\begin{cases} x+n+1,\, if \,m=n+1 \\ 1,\, if \,m=n \\ ...
2
votes
0answers
49 views

Generalized separating systems

We call a set system $\mathcal{A}$ of subsets of the $n$ element universe $U$ a separating system if for any pair of elements $x,y \in U$ there is at least one set $A \in \mathcal{A}$ such that either ...
7
votes
1answer
463 views

How to determine if there exists a non-zero vector in the kernel

If you are given a $0$-$1$ circulant matrix with $n$ rows and $n$ columns, is there an efficient way of determining if there exists a non-zero $\{-1,0,1\}$-vector in its kernel? Could this problem ...
0
votes
0answers
89 views

topological space of Wang Tile

When trying to reprove a theorem in Wang tile: An established proof in Wang Tile which I doubt , a few notions are provided which I would like to seek for more information: For a given set of blocks ...
3
votes
3answers
193 views

Time-inhomogeneous Markov Chains

I'm trying to find out what is known about time-inhomogeneous ergodic Markov Chains where the transition matrix can vary over time. All textbooks and lecture notes I could find initially introduce ...
5
votes
1answer
152 views

Can I weaken the minimum degree hypothesis in Nash-Williams' triangle decomposition conjecture?

In what follows, all graphs $G$ are $K_3$-divisible (all degrees even, number of edges a multiple of three) on $n$ vertices, where $n$ is not too small. The famous Nash-Williams conjecture claims ...
3
votes
3answers
735 views

An established proof in Wang Tile which I doubt

When I was reading the paper: Wang, Hao. "Notes on a class of tiling problems." Fundamenta Mathematicae 82.4 (1975): 295-305. from http://matwbn.icm.edu.pl/ksiazki/fm/fm82/fm82119.pdf I could not ...
4
votes
2answers
223 views

Equality-preserving embeddings of finite trees

For finite trees $T_{1}$ and $T_{2}$ labelled by elements of some infinite set $S$, (we may assume that $S=\mathbb{N}$ without loss of generality), we define an equality-preserving embedding $f$ to be ...
8
votes
5answers
989 views

Are all almost regular graphs obvious?

Let the maximum and minimum degress of a graph be denoted (as usual) by $\Delta$ and $\delta$ respectively. A graph is almost regular if $\Delta-\delta=1$. Now, here is a simple way to generate ...
4
votes
1answer
209 views

Circulant matrix with integer entries and determinant 1 or -1

CONJECTURE Let $A= (c_0,c_1,\ldots,c_n)$ be a circulant matrix, i.e if $(c_0,c_1,\ldots,c_n)$ is the first column of $A$ then the $i$th column of $A$ is obtained by applying the permutation ...
1
vote
0answers
221 views

Enumerating certain types of permutation polynomials

Given a prime power $q$, I would like to enumerate (preferably up to isomorphism*) all the permutation polynomials $f(x)$ on $K = GF(q^3)$ satisfying the following conditions: $f(ax) = af(x)$ for ...
3
votes
1answer
98 views

Results where complexity bounds implies finite number of test cases

We have all been there, when a formula works for the first 30 parameters, but it is not sufficient for a proof. My question is where one can actually just check a finite number of cases, to conclude ...
2
votes
3answers
169 views

branching schubert calculus

Let $X=Gr(r,V), Y=Gr(r+1,W)$ where $V,W$ are complex vector spaces with $\dim V > r$ and $\dim W > \dim V$. Let $\phi:X\rightarrow Y$ be some embedding of varieties. This induces a morphism on ...
10
votes
1answer
646 views

Two to the power of a triangular number: bijections

The numbers $2^{n(n+1)/2}$ come up in various enumerative contexts. In addition to the trivial example (bit-strings of length $n(n+1)/2$) and the old example of domino tilings of Aztec diamonds ...
5
votes
0answers
94 views

Monotone embedding of complete binary tree in hypercube

Embedding different graphs, especially binary trees, in the hypercube has a huge literature. However, I could not find anything if we restrict the embedding to be monotone. So I would like to ...
7
votes
0answers
176 views

A strong sum-product “for translates” in finite fields

In the course of some recent research, I've sketched out a proof of the following result. My basis question is: is the result interesting? Proposition There exists an absolute constant $c$ such ...
1
vote
0answers
128 views

Placing numbers $1,2,\ldots,n^2$ in a square so that numbers of any two adjacent unit subcube are coprime

It is proved HERE that there is a natural number $N$ such that for any $n > N$ it is possible to place numbers $1,2,\cdots, n^2$ is an $n\times n$ square such that the numbers in any two adjacent ...
1
vote
0answers
56 views

Building set of n-bit numbers that have m bits are set and any two numbers in this set have distance 1

I want to build numbers set(one of possible) that meet following criteria We are given n-bit numbers. Select subset(X) of them that have exactly m bits set to 1. Then I need to build subset(Y) of ...
5
votes
0answers
146 views

Are the roots of chromatic polynomials plus a fixed constant dense in $\mathbb{C}$?

Alan Sokal proved that chromatic roots are dense in the whole complex plane. I.e., if $P(G;z)$ denotes the chromatic polynomial of a finite simple graph $G$ evaluated at $z \in \mathbb{C}$, then ...
2
votes
3answers
155 views

Examples of graph properties characterized by forbidden (not necessarily induced) subgraphs

A graph property is hereditary if it is closed under taking induced subgraphs (equivalently, if it is closed under removing vertices). A graph property is monotone if it is closed under taking ...
4
votes
1answer
225 views

Examples of specializations of elementary symmetric polynomials

Let $\mathcal{S}_{x}=\{x_{1,},x_{2},\ldots x_{n}\}$ be a set of $n$ indeterminates. The $h^{th}$elementary symmetric polynomial is the sum of all monomials with $h$ factors \begin{eqnarray*} ...
7
votes
1answer
176 views

Status of Barany's conjecture?

One of Barany's most intriguing conjectures is about the $f$-vectors of convex polytopes. It asks: Let $P$ be a convex $d$-polytope. Is it always true that $f_k \geq \min(f_0, f_{d-1})$? A ...
4
votes
3answers
575 views

Analogy between Integers and Permutations

I am reading Andrew Granville's Anatomy of Integers and Permutations where it is argued the factorization of a permutation into disjoint cycles is analogous to the factorization of a number into prime ...
1
vote
1answer
101 views

Constructive ideas behind “covering” a set with subsets of fixed size

The question is the following: how many subsets of size $5$ from a set $A$ of size $16$ do we need so that any subset of size 2 of $A$ is also a subset of one of the selected subsets of size $5$? How ...
1
vote
0answers
63 views

labeling vertices in a graph to minimize distance between adjacent vertices

We have a regular graph $G$ of degree $m$ on $n$ vertices and we label each of its vertices with the number $1$ through $n$. What can we say about the maximum difference between the numbers of two ...
7
votes
1answer
282 views

Is there a name for infinite words containing every finite words?

Apparently, the closest thing I've found would be normal number http://mathworld.wolfram.com/NormalNumber.html But requiring that every finite words occurs is weaker than this property. So I'm ...
4
votes
3answers
332 views

Combinatorial counting with symmetry

Let $A$ be a set of objects where $|A|=n$. We want to count all the possible ways that we can arrange these objects into $n$ bags with exactly $n$ objects in each. We can reuse any object, however, no ...
6
votes
3answers
674 views

Combinatorial identity involving the square of $\binom{2n}{n}$

Is there any closed formula for $$ \sum_{k=0}^n\frac{\binom{2k}{k}^2}{2^{4k}} $$ ? This sum of is made out of the square of terms $a_{k}:=\frac{\binom{2k}{k}}{2^{2k}}$ I have been trying to verify ...
6
votes
1answer
351 views

Paths in groups

Given a finite group $G$, write $K(G)$ for the complete digraph on the elements of $G$. Label the edge from $g$ to $h$ by element $g^{-1}h$. Question: For what groups does there exist a Hamiltonian ...
1
vote
1answer
123 views

Sequences that represent different drawing of chords?

In combinatorics there are there are special kind of sequences, in which their terms represent the number of different ways that we can draw chords with some properties. Actually my question is ...
2
votes
1answer
92 views

Integrally closed polytopes from 01-matrices

Let $A$ be a matrix with entries either 0 or 1, where each column contains at least one 1, to remove trivial degenerations. Let $P$ be the convex hull of all integer vectors $x$ that satisfy $Ax \leq ...
7
votes
0answers
227 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. ...
5
votes
1answer
287 views

A result from Peter McMullen's thesis

The classical definition of regular polytopes is recursive. It says that a polytope is regular if its facets and vertex figures (both smaller-dimensional polytopes) are regular. The modern definition ...
17
votes
0answers
151 views

A small unavoidable collection of subgraphs

What is the smallest number S(k,n) of unlabeled graphs on k vertices such that every simple graph on n vertices contains at least one of these as an induced subgraph? I'd like to avoid exhaustive ...
0
votes
0answers
89 views

Estimating when does a certain binomial sum exceed an upper bound

Given a fixed integer $n > 0$ and $0 \le m \le n$ let us define the numbers $$f_{n,m} = \sum_{i=\lfloor m/2 \rfloor}^m {n-2i \choose n - m -i}{i+1 \choose m - i +1}.$$ For example $f_{n,0} = ...
1
vote
1answer
106 views

Formula for the Ordinal Number of k-Sets of Positive Integers

Background of my question is, that I would like to store flags indicating the relation between a pairs of non-adjacent edges of a graph (that relation could for example be, whether the edges cross, ...