# Tagged Questions

**1**

vote

**1**answer

164 views

### Random graphs with boundary in a game (Tsuro)

Suppose we have an $n \times n$ board and we have $n^2 - 1$ square tiles. These tiles consist of a 8 vertices, two on each edge, and every vertex is connected to precisely one other vertex. These ...

**2**

votes

**0**answers

136 views

### Largest Fourier coefficient of sparse boolean function

Consider a Boolean function $f: GF(2)^n \rightarrow \{0, 1 \}$. I would like to show that if $f$ is sparse, i.e. $\sum f(i) \leq t$, then $f$ must have a large Fourier coefficient. (A Fourier ...

**8**

votes

**1**answer

152 views

### Extending subsets to supersets in different ways

We are given a collection of sets $A_1,\ldots,A_s$, pairwise different and each of cardinality $k$, and a collection of sets $B_1,\ldots,B_s$, pairwise different and each of cardinality $l>k+1$, ...

**4**

votes

**1**answer

152 views

### Graph of graph homomorphisms

For (finite or infinite) undirected, simple graphs $G, H$, let
$V_{\text{Hom}} = \{f:G\to H:f\text{ is a graph homomorphism}\}$, and
$E_{\text{Hom}} =\big\{\{f,g\}\subseteq V_{\text{Hom}}: ...

**3**

votes

**1**answer

153 views

### Seymour's second neighborhood conjecture

Does anyone out there know if Seymour's second neighborhood conjecture is still open? if not, I would appreciate any references.

**2**

votes

**0**answers

40 views

### Decomposing a weakly chordal graph into disjoint union of co-chordal graphs

A graph G is said to be co-chordal if it is $\bar C_n$-free for any $n \ge 4$. It is weakly chordal if it is $C_n$ and $\bar C_n$ free for all $n\ge 5$. Assume that the induced matching number of $G$ ...

**5**

votes

**1**answer

95 views

### Algorithm that generates minimum n-simplex that cover n-cube?

Given an $n$-cube with unit volume, is there any algorithm that generates a minimum volume $n$-simplex that covers the $n$-cube?

**5**

votes

**0**answers

60 views

### Approximating a max-cut's intersection with other cuts

(This is a cross-post from the Theoretical Computer Science Stack Exchange.)
For the purposes of this question, a cut in a graph $G$ is the edge-set $\delta (S)\subseteq E(G)$ between some vertex-set ...

**5**

votes

**1**answer

127 views

### Integer decomposition of dilated integral polytopes

For $n > 0$, let $P$ be an integral polytope, that is, the convex hull in $\mathbb{R}^n$ of points in $\mathbb{Z}^n$. Suppose that $\dim(P) = n$.
Question: Given $d > n + 2$ is it true that
$$ ...

**5**

votes

**1**answer

144 views

### A generalization of Erdős–Newman–Mirsky?

Given a sequence $S$ of natural numbers, write ${\bf Gap}(S)$ for the set of differences between consecutive terms. (So $|{\bf Gap}(S)|=1$ precisely for arithmetic progressions, hence the connection ...

**25**

votes

**1**answer

994 views

### Combinatorics of K(Z,2)?

Anybody knows a semi-simplicial model for $K(Z,2)$ having finite number of simplexes in any dimension? With some regular description? I have heard about big activity on triangulating $CP^n$ but this ...

**1**

vote

**0**answers

32 views

### Lattice-isotopic essentialization of arrangements

I'm working on a problem related to
$\textbf{Randell's isotopy theorem}$ for complex hyperplane arrangements. I have a question which seems quite obvious. However, I haven't found a rigorous proof ...

**7**

votes

**2**answers

195 views

### Models for graphs representing real-life networks

I am interested in basic models of graphs (stochastic or deterministic) that are offered for real-life networks (like social networks, the Internet, neuron networks).
I will be thankful for answers ...

**3**

votes

**1**answer

132 views

### An upper bound on the number of sets of parallel lines covering points in a finite plane?

Let $\mathbb{F}$ be a finite field of characteristic $2$. Let $L_m$ denote the set of lines in $\mathbb{F}^2$ with slope $m\in\mathbb{F}$, that is, all parallel lines of the form $y=mx+b$. Consider a ...

**84**

votes

**7**answers

4k views

### Is the set $ AA+A $ always at least as large as $ A+A $?

Let $A$ be a finite set of real numbers. Is it always the case that $|AA+A| \geq |A+A|$?
My first instinct is that this is obviously true, and there is a one-line proof which I am foolishly ...

**12**

votes

**2**answers

702 views

### Mysterious identity between numbers of odd/even meander systems

Definitions:
An upper arch system of order $n$ is a subset of the plane consisting of $n$ non-intersecting closed semicircles in the upper half-plane whose endpoints belong to the set $\{(k,0)\mid ...

**12**

votes

**2**answers

639 views

### A combinatorial question about orthonormal bases

Suppose that $F:S^{n-1}\to A$ is a map of sets from the unit sphere in $\mathbb R^n$ to an abelian group, and that the sum $F(v_1)+\dots +F(v_n)$ over an orthonormal basis is independent of the basis. ...

**14**

votes

**0**answers

183 views

### Coloring a Ferrers diagram

I've shopped the problem below around a bit and it seems like it might be known, or not that hard to resolve, but so far I've come up empty-handed.
Say that a coloring of the dots of a Ferrers ...

**4**

votes

**0**answers

121 views

### Connection between connectivity and cohesion of a graph

Tutte [1] proved that, for every $3$-connected graph $G$ and vertices $u$ and $v$, there exists a nonseparating $uv$-path.
A graph $G$ is $t$-cohesive if $G$ is connected, has at least two vertices, ...

**2**

votes

**2**answers

281 views

### Local coordinates on (infinite dimensional) Lie groups, factorization of Riemann zeta functions

Given a (finite dimensional) Lie group $G$ (real $k=\mathbb{R}$ or complex $k=\mathbb{C}$) and its Lie algebra $\mathfrak{g}$, one can prove (a basis $B=(b_i)_{1\leq i\leq n}$ of $\mathfrak{g}$ being ...

**3**

votes

**1**answer

136 views

### A question of terminology regarding integer partitions

I am wondering if there is a standard notation and name for the following. Let $\lambda$ be a partition $\lambda_1\geq \lambda_2\geq\cdots\geq \lambda_r\geq 1$ of $n$ into $r$ parts. Then we can ...

**3**

votes

**1**answer

123 views

### Regarding left-to-right minima

Let $\rho$ be a permutation on $[1,n]$ and $l_i$ be the number of left-to-right minima in $\rho_{i\ldots n}$, I know that for a random permutation $E[l_1] = H_n$ (the $n$-th Harmonic number) but is ...

**20**

votes

**2**answers

1k views

### An unfair marriage lemma

I am looking for a citeable reference to the following generalization of Hall's Marriage Theorem:
Given a bipartite graph of boys and girls. In addition to gender difference, they are divided into ...

**5**

votes

**2**answers

185 views

### Ordered lattice point enumeration

I initially asked this question over at StackOverflow as it has algorithmic flavor to it, but I haven't been getting much traction so I thought I would probe the mathematics community.
Setup: Let ...

**7**

votes

**0**answers

111 views

### Some $q-$analogues of $ \sum\limits_{j = - k}^k {{{( - 1)}^{ j}}}\binom{n}{k-j}\binom{n}{k+j}=\binom{n}{k}.$

Let ${\left( {a;q} \right)_n}=\prod\limits_{j = 0}^{n - 1} {(1-{q^j}a} )$ and
let $ {{n}\brack{k}}_q$ denote a $q-$binomial coefficient.
I am interested in $q-$analogues of the identity $ ...

**1**

vote

**1**answer

80 views

### Balls from bin with replacement, distinct elements, concentration inequality

Draw $n$ numbers, denoted by $a_1, a_2, \ldots, a_n$, from set $[n]$, that is, for each $i$, $a_i$ is a uniformly random number from $[n]$.
Let $A = \{a_1, a_2, \ldots, a_n\}$. Then
$$
...

**6**

votes

**0**answers

85 views

### The Maximum Number of Lines Contained in the Point Set of a Finite Projective Plane

Consider a finite projective plane of order $q$. Define $f(m)$ to be the maximum number of lines completely contained in any point set of size $m$, where $1 \leq m \leq q^2+q+1$. I would like to ...

**8**

votes

**1**answer

185 views

### Determinant of a checkerboard Hankel matrix with Catalan numbers

My goal is to compute
\begin{equation}
I = \det \left(\mathbf{I} + \mathbf{A}\right)
\end{equation}
where $\mathbf{A}$ is a $n \times n$ checkerboard matrix filled with Catalan numbers:
$$
\left\{
...

**3**

votes

**0**answers

100 views

### What is known about the complexity of this covering problem?

Let $G=(V,E)$ be a graph. A vertex set $X\subseteq V$ is called critical if $X\neq\emptyset$ and no vertex in $V\setminus X$ is adjacent to exactly one vertex in $X$. The problem is to find a vertex ...

**15**

votes

**1**answer

854 views

### Evaluating a remarkable term for primes p = 5 (mod. 8)

Let $p > 3$ be a prime number, and $\zeta$ be a primitive $p$-th root of unity. I am interested in knowing the exact value of
$$w_p = \prod_{a \in (\mathbb F_p^{\times})^2}(1 + \zeta^a) + \prod_{b ...

**11**

votes

**2**answers

455 views

### “The Two Sheriffs” puzzle -2: threshold for security

I've already asked a question “The Two Sheriffs” puzzle with wrong assumption. Yoav Kallus in his amazing answer using Fano plane showed that the problem has a solution in the case of seven suspects.
...

**2**

votes

**0**answers

58 views

### Edge-disjoint path-systems in infinite digraphs

Let $ D=(V,A) $ be a directed graph without backward-infinite paths and let $ \{ s_i \}_{i<\lambda},U \subset V $ where $
\lambda $ is some cardinal. Assume that for all $ u\in U $ there is a ...

**3**

votes

**0**answers

120 views

### A Result of Anders Bjorner: Matchings in countably infinite geometric lattices of finite height

Let $L$ be a countably infinite geometric lattice of finite height $r\ge3$. (A geometric lattice of height $r$ is an atomistic semimodular lattice such that every maximal chain has $r+1$ elements.)
...

**28**

votes

**1**answer

1k views

### “The Two Sheriffs” puzzle

This puzzle is taken from the book Mathematical puzzles: a connoisseur's collection by P. Winkler.
Two sheriffs in neighboring towns are on the track of a killer, in a
case involving eight ...

**4**

votes

**2**answers

172 views

### How many simple cycles can a graph with $n$ vertices and $m$ edges have?

I am mainly interested in the smallest number of simple cycles a graph with $n$ vertices and $m$ edges must have.
For example, if $m\le n-1$, this number is $0$, then if $n\le m \le 3(n-1)/2$, it is ...

**7**

votes

**2**answers

171 views

### Decomposition of a cross-polytope into simplices

Consider the standard embedded $n$-cross polytope $P_n$ with vertices $\pm e_i \in \mathbb R^n$. Let us consider decompositions of this polytope into $2^{n-1}$ simplices, such that these simplices ...

**4**

votes

**1**answer

191 views

### Young tableau with no i in row i, name that derangement

This question has its genesis in a group assignment: $k$ students are to be given oral exams. Each student will be asked one distinct question from $n$ questions given to them earlier, no two students ...

**6**

votes

**2**answers

106 views

### Reference request: monochromatic paths in edge-colored complete graphs

Given $k,c \in \mathbb{N}$, let $P(k,c)$ be the minimum $n$ such that no matter how we color the edges of the complete graph $K_n$ with $c$ colors, there is always a monochromatic path of length $k$.
...

**3**

votes

**1**answer

140 views

### Identify ring of polynomials symmetric under forgetting variables

I came across the following ring $A$, which appears as a Chow ring. I am wondering if it has been studied before; in particular, I am looking for a reference where this object might have been ...

**7**

votes

**1**answer

118 views

### Is there a Degenerate Dependency Local Lemma?

The Lovasz Local Lemma has several generalizations, with names usually starting with L, such as Lopsided or Lefthanded.
Here I ask whether another possible generalization (for which I could not yet ...

**2**

votes

**0**answers

49 views

### Bounds on number of distinct substrings

I have a table with $r$ rows of length $\ell$, with each cell containing a letter from an alphabet $A$ of length $a$. I'm trying to determine the expected number of distinct strings of length $k$ ...

**3**

votes

**1**answer

76 views

### congruence for Stirling numbers of the first kind

Suppose we write $s(n,k)$ for the Stirling numbers of the first kind. When $p$ is a prime number, I'm interested in knowing when $s(p^a, k)$ is divisible by $p^a$. So:
What is known about ...

**1**

vote

**1**answer

113 views

### Generating function for $t$-residues of partitions using Heisenberg + $\hat{sl_t}$ representation theory

Recall that for $t\geq2$, a partition is a $t$-core if none of its hooklengths is divisible by $t$. It is known that the $t$-cores are parametrized by ${\mathbb Z}^{t-1}$. More precisely, let ...

**25**

votes

**0**answers

583 views

### 3-colorings of the unit distance graph of $\Bbb R^3$

Let $\Gamma$ be the unit distance graph of $\Bbb R^3$: points $(x,y)$ form an edge if $|x,y|=1$.
Let $(A,B,C,D)$ be a unit side rhombus in the plane, with a transcendental diagonal, e.g. $A = ...

**3**

votes

**0**answers

195 views

### adding a boundary to the finite upper half-plane

Let $\Bbb{F}_q$ be a finite field, let $\delta \in \Bbb{F}_q$ be a non-square, let $\Bbb{F}_{q^2} = \Bbb{F}_q\big( \sqrt{\delta} \big)$ be the corresponding quadratic extension,
and let ...

**3**

votes

**2**answers

136 views

### The Hadwiger number of $L(K_n)$

For $n\in\mathbb{N}$ we consider the set $\{1,\ldots,n\}$ and define the line graph $L(K_n)$ of the complete graph $K_n$ as follows:
$V(L(K_n)) = \big\{\{a,b\}: a,b\in \{1,\ldots, n\}, a\neq b ...

**4**

votes

**1**answer

114 views

### Segments on a family of parallel lines

Let $\{l_i:i\in I\}$ be a family of parallel lines on the plane $\mathbb{R}^2$. Suppose for each $i\in I$ there is a closed segment $s_i\subset l_i$. Moreover, for each triple $i_1,i_2,i_3$ there ...

**3**

votes

**3**answers

340 views

### When few simple conditions yield a unique intricate structure

If people were asked to do a brainstorming related to the title, everyone would probably come up with dozens of examples. Those could include things as different as
the Mandelbrot set, Julia sets ...

**2**

votes

**1**answer

133 views

### Is the number of vertices bounded for fixed max degree and fixed diameter?

Are there positive integers $\Delta, d$ such that the following statement is true?
For every $n\in \mathbb{N}$ there is a graph $G = (V,E)$ such that $|V| = n$,
$\Delta(G) \leq \Delta$ ...

**6**

votes

**4**answers

316 views

### Is there a non-explicit characterization of the Specht modules?

It is a basic fact about the symmetric group $S_n$ that its irreducible representations are indexed by partitions of $n$.
My question is, can the association between partitions and irreps be ...