English
Related papers

Related papers: Counterexamples to Stanley's conjecture on dimer c…

200 papers

The Directed Grid Theorem, stating that there is a function $f$ such that a directed graphs of directed treewidth at least $f(k)$ contains a directed grid of size at least $k$ as a butterfly minor, after being a conjecture for nearly 20…

Combinatorics · Mathematics 2026-02-19 Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge

Let $x$ be an eigenvector for an element of a finite irreducible reflection group $W$. Let $W_x$ denote the subgroup of $W$ which stabilises $x$. We provide an upper bound for the number of roots in the root system of $W_x$ . This…

Representation Theory · Mathematics 2015-12-08 Masoud Kamgarpour

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

Combinatorics · Mathematics 2026-05-28 Yutong Zhang , Yaoran Yang

An $SL_k$-tiling is a bi-infinite array of integers having all adjacent $k\times k$ minors equal to one and all adjacent $(k+1)\times (k+1)$ minors equal to zero. Introduced and studied by Bergeron and Reutenauer, $SL_k$-tilings generalize…

Combinatorics · Mathematics 2025-04-03 Zachery Peterson , Khrystyna Serhiyenko

Saxl's conjecture (2012) asserts that for the staircase partition $\rho_k = (k, k-1, \ldots, 1)$, the tensor square of the corresponding irreducible representation of the symmetric group $S_{T_k}$ contains every irreducible representation…

Representation Theory · Mathematics 2026-04-10 Soong Kyum Lee

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Combinatorics · Mathematics 2015-05-20 Sean R. Carrell , Guillaume Chapuy

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…

Commutative Algebra · Mathematics 2007-05-23 Carlos D'Andrea , Hoon Hong , Teresa Krick , Agnes Szanto

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,..., x_n]$ generated by monomials $u_1,u_2,..., u_t$. We show that $S/I$ is pretty clean if either: 1) $u_1,u_2,..., u_t$ is a filter-regular sequence, 2)…

Commutative Algebra · Mathematics 2013-12-16 Somayeh Bandari , Kamran Divaani-Aazar , Ali Soleyman Jahan

In 1981, Stanley applied the Aleksandrov-Fenchel inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with…

Combinatorics · Mathematics 2007-05-23 David G. Wagner

We introduce 2-partitionable clutters as the simplest case of the class of $k$-partitionable clutters and study some of their combinatorial properties. In particular, we study properties of the rank of the incidence matrix of these clutters…

Commutative Algebra · Mathematics 2008-06-12 Alejandro Flores-Méndez , Isidoro Gitler , Enrique Reyes

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…

Combinatorics · Mathematics 2020-04-27 William Gustafson

We prove a conjecture of Michel--Venkatesh on joinings of distinct Linnik problems, in the setting of simultaneous quaternionic embeddings of imaginary quadratic fields having sufficiently many small split primes. This splitting condition…

Number Theory · Mathematics 2026-03-09 Valentin Blomer , Farrell Brumley , Maksym Radiwiłł

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

Combinatorics · Mathematics 2023-09-29 Per Alexandersson , Ryan Mickler

We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…

Combinatorics · Mathematics 2012-12-27 Bernhard Hanke , Raman Sanyal , Carsten Schultz , Günter M. Ziegler

One of the equivalent formulations of the Kadison-Singer problem which was resolved in 2013 by Marcus, Spielman and Srivastava, is the "paving conjecture". Roughly speaking, the paving conjecture states that every positive semi-definite…

Probability · Mathematics 2021-01-08 Kasra Alishahi , Milad Barzegar

We study algebras satisfying a two-term multilinear identity, namely one of the form $x_1 \cdots x_n= q x_{\sigma(1)} \cdots x_{\sigma(n)}$, where $q$ is a parameter from the base field. We show that such algebras with $q=1$ and $\sigma$…

Rings and Algebras · Mathematics 2025-04-17 Allan Berele , Peter Danchev , Bridget Eileen Tenner

Let $\Phi_n(x)$ denote the $n$th cyclotomic polynomial. In 1968 Sister Marion Beiter conjectured that $a_n(k)$, the coefficient of $x^k$ in $\Phi_n(x)$, satisfies $|a_n(k)|\le (p+1)/2$ in case $n=pqr$ with $p<q<r$ primes (in this case…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

Discrete Mathematics · Computer Science 2022-06-06 Jarkko Kari , Etienne Moutot