中文
相关论文

相关论文: Counterexamples to the 0-1 conjecture

200 篇论文

We present two extensions of the linear bound, due to Marcus and Tardos, on the number of 1's in an n by n 0-1 matrix avoiding a fixed permutation matrix. We first extend the linear bound to hypergraphs with ordered vertex sets and, using…

组合数学 · 数学 2007-05-23 Martin Klazar , Adam Marcus

Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…

组合数学 · 数学 2026-05-01 David E Speyer

We first study some properties of images of commuting differential operators of polynomial algebras of order one with constant leading coefficients. We then propose what we call the image conjecture on these differential operators and show…

复变函数 · 数学 2010-05-25 Wenhua Zhao

A result by C. C.-A. Cheng, J. H. Mckay and S. S.-S. Wang says the following: Suppose the Jacobian of $A$ and $B$ is invertible in $\mathbb{C}[x,y]$ and the Jacobian of $A$ and $w$ is zero for $A,B,w \in \mathbb{C}[x,y]$. Then $w \in…

交换代数 · 数学 2018-02-21 Vered Moskowicz

The well-known Chowla and Zassenhaus conjecture, proven by Cohen in 1990, states that if $p>(d^2-3d+4)^2$, then there is no complete mapping polynomial $f$ in $\Fp[x]$ of degree $d\ge 2$. For arbitrary finite fields $\Fq$, a similar…

Let \( G \) be a graph of order \( n \) with maximum degree $\Delta$, and let $P(G,x)$ denote its chromatic polynomial. We investigate several properties of $P(G,x)$ related to its derivatives and higher-order derivatives. First, we study…

组合数学 · 数学 2026-04-21 Bo Ning , Yan Yang

Let M_n be the n! * n! matrix indexed by permutations of S_n, defined by M_n(sigma,tau)=1 if every descent of tau^{-1} is also a descent of sigma, and M_n(sigma,tau)=0 otherwise. We prove the following result, conjectured by P. Dehornoy:…

组合数学 · 数学 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

To any two graphs G and H one can associate a cell complex Hom(G,H) by taking all graph multihomorphisms from G to H as cells. In this paper we prove the Lovasz Conjecture which states that if Hom(C_{2r+1},G) is k-connected, then…

组合数学 · 数学 2007-05-23 Eric Babson , Dmitry N. Kozlov

We consider skew-products of quadratic maps over certain Misiurewicz-Thurston maps and study their statistical properties. We prove that, when the coupling function is a polynomial of odd degree, such a system admits two positive Lyapunov…

动力系统 · 数学 2012-07-12 Rui Gao , Weixiao Shen

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

表示论 · 数学 2025-10-27 Ewan Cassidy

In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection between critical points of the likelihood function on the complex variety of matrices of rank r and critical points on the complex variety of…

代数几何 · 数学 2017-10-10 Jan Draisma , Jose Rodriguez

We prove Soergel's conjecture on the characters of indecomposable Soergel bimodules. We deduce that Kazhdan-Lusztig polynomials have positive coefficients for arbitrary Coxeter systems. Using results of Soergel one may deduce an algebraic…

表示论 · 数学 2016-11-18 Ben Elias , Geordie Williamson

P\'or and Wood conjectured that for all $k,l \ge 2$ there exists $n \ge 2$ with the following property: whenever $n$ points, no $l + 1$ of which are collinear, are chosen in the plane and each of them is assigned one of $k$ colours, then…

组合数学 · 数学 2014-10-13 Vytautas Gruslys

A word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose…

组合数学 · 数学 2024-06-25 Jean-Luc Baril , Sergey Kirgizov , José L. Ramírez , Diego Villamizar

We provide a non-recursive description for the bounded admissible sets of masks used by Deodhar's algorithm to calculate the Kazhdan--Lusztig polynomials $P_{x,w}(q)$ of type $A$, in the case when $w$ is hexagon avoiding and maximally…

组合数学 · 数学 2007-05-23 Brant C. Jones

We give a brief history of transcendental number theory, including Schanuel's conjecture (S). Assuming (S), we prove that if z and w are complex numbers, not 0 or 1, with z^w and w^z algebraic, then z and w are either both rational or both…

数论 · 数学 2011-03-31 Diego Marques , Jonathan Sondow

It is well known that many geometric properties of Schubert varieties of type $A$ can be interpreted combinatorially. Given two permutations $w,x\in S_n$ we give a combinatorial consequence of the property that the smooth locus of the…

组合数学 · 数学 2019-04-17 Erez Lapid

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally…

表示论 · 数学 2015-07-06 Jun Hu , Jing Zhang

For any connected complex reductive group $G$ and element $z$ of its Weyl group $W$, we use work of Lusztig and Abreu-Nigro to compute the graded $W$-character of the intersection cohomology of any closed Lusztig variety for $z$ over the…

表示论 · 数学 2026-05-20 Minh-Tâm Quang Trinh

The paper is devoted to the generalization of Lusztig's q-analog of weight multiplicities to the Lie superalgebras gl(n,m) and spo(2n,M). We define such q-analogs K_{lambda,mu}(q) for the typical modules and for the irreducible covariant…

表示论 · 数学 2008-06-23 Cedric Lecouvey , Cristian Lenart