中文
相关论文

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

200 篇论文

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

数论 · 数学 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

Given an integer g, g > 1, an integer w, -1 < w <g - 1, and a set of g distinct numbers, c_1, ..., c_g, we present a conjectured identity for Stirling numbers of the first kind. We have proven all the equalities in case g < 7; and for the…

组合数学 · 数学 2018-08-29 Paul Federbush

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

组合数学 · 数学 2013-08-01 Michael Chmutov

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

组合数学 · 数学 2017-01-20 Xiang-dong Hou

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

组合数学 · 数学 2007-05-23 Astrid Reifegerste

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

数论 · 数学 2014-08-08 Hao Pan , Zhi-Wei Sun

We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey,…

组合数学 · 数学 2007-05-23 R. M. Green

In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…

数论 · 数学 2020-06-01 Long Li , Su-Dan Wang

The combinatorial invariance conjecture (due independently to G. Lusztig and M. Dyer) predicts that if $[x,y]$ and $[x',y']$ are isomorphic Bruhat posets (of possibly different Coxeter systems), then the corresponding Kazhdan-Lusztig…

表示论 · 数学 2022-05-13 Gaston Burrull , Nicolas Libedinsky , David Plaza

For every bivariate polynomial $p(z_1, z_2)$ of bidegree $(n_1, n_2)$, with $p(0,0)=1$, which has no zeros in the open unit bidisk, we construct a determinantal representation of the form $$p(z_1,z_2)=\det (I - K Z),$$ where $Z$ is an…

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

组合数学 · 数学 2012-01-17 Greta Panova

We prove Lusztig's conjectures P1-P15 for Coxeter groups with complete graph, using deceasing induction on $ \mathbf{a} $-values and a kind of decomposition formula of Kazhdan-Lusztig basis elements. As a byproduct, we give a description of…

表示论 · 数学 2020-09-03 Xun Xie

Brouwer conjectured that the sum of the first $k$ largest Laplacian eigenvalues of an $n$-vertex graph is less than or equal to the number of its edges plus $\binom{k+1}{2}$ for each $k\in \{1,2,\cdots,n\}$, which has come to be known as…

组合数学 · 数学 2025-03-17 Xiaodan Chen , Junwei Zi

Let $G$ be a simple graph on $n$ vertices and $m$ edges with chromatic number $\chi$, and let $\lambda_n$ denote the least adjacency eigenvalue. Solving a conjecture of Fan, Yu and Wang~[Electron. J. Combin., 2012], we prove that when $3\le…

组合数学 · 数学 2026-01-22 Quanyu Tang , Clive Elphick

In 2001, Woodall conjectured that for every pair of integers $s,t \ge 1$, all graphs without a $K_{s,t}$-minor are $(s+t-1)$-choosable. In this note we refute this conjecture in a strong form: We prove that for every choice of constants…

组合数学 · 数学 2022-01-25 Raphael Steiner

Fink, M\'esz\'aros and St.Dizier showed that the Schubert polynomial $\mathfrak{S}_w(x)$ is zero-one if and only if $w$ avoids twelve permutation patterns. In this paper, we prove that the Grothendieck polynomial $\mathfrak{G}_w(x)$ is…

组合数学 · 数学 2025-04-09 Yiming Chen , Neil J. Y. Fan , Zelin Ye

We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…

组合数学 · 数学 2026-03-23 David Anderson , Greta Panova , Leonid Petrov

Let $S_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. For two permutations $u, v\in S_n$ such that $u\leq v$ in the Bruhat order, let $R_{u,v}(q)$ and $\R_{u,v}(q)$ denote the Kazhdan-Lusztig $R$-polynomial and $\R$-polynomial,…

组合数学 · 数学 2013-12-10 William Y. C. Chen , Neil J. Y. Fan , Peter L. Guo , Michael X. X. Zhong

We study the commutative algebra of three bihomogeneous polynomials p_0,p_1,p_2 of degree (2,1) in variables x,y;z,w, assuming that they never vanish simultaneously on P^1 x P^1. Unlike the situation for P^2, the Koszul complex of the p_i…

交换代数 · 数学 2012-01-31 David Cox , Alicia Dickenstein , Hal Schenck

For any two involutions y,w in a Weyl group (y\le w), let P_{y,w} be the polynomial defined in [KL]. In this paper we define a new polynomial P^\sigma_{y,w} whose i-th coefficient is a_i-b_i where the i-th coefficient of P_{y,w} is a_i+b_i…

表示论 · 数学 2011-11-07 George Lusztig , David A. Vogan