English
Related papers

Related papers: A conjectured formula for the rational $q,t$-Catal…

200 papers

We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…

Combinatorics · Mathematics 2020-11-24 Paul Barry

By using level one polynomial representations of affine Hecke algebras of type $A$, we obtain a $(q,t)$-analogue of the chromatic symmetric functions of unit interval graphs which generalizes Syu Kato's formula for the chromatic symmetric…

Combinatorics · Mathematics 2025-04-01 Tatsuyuki Hikita

In a 2016 ArXiv posting F. Bergeron listed a variety of symmetric functions $G[X;q]$ with the property that $G[X;1+q]$ is $e$-positive. A large subvariety of his examples could be explained by the conjecture that the Dyck path LLT…

Combinatorics · Mathematics 2019-04-18 Adriano M. Garsia , James Haglund , Dun Qiu , Marino Romero

A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…

Combinatorics · Mathematics 2010-05-04 Steven V Sam , Kevin M. Woods

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…

Combinatorics · Mathematics 2007-05-23 Trueman MacHenry , Geanina Tudose

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

Rings and Algebras · Mathematics 2021-11-09 Jiahao Hu , Aleksandar Milivojević

Starting from Jacobi-Trudi's type determinental expressions for the Schur functions corresponding to types $B,C$ and $D,$ we define a natural $q$-analogue of the multiplicity $[V(\lambda):M(\mu)]$ when $M(\mu)$ is a tensor product of row or…

Representation Theory · Mathematics 2007-05-23 Cedric Lecouvey

Let $\mathbb F_q$ be the finite field of $q$ elements having characteristic $p$, and denote by $\mathbb K_\infty=\mathbb F_q((1/t))$ the field of formal Laurent series in $1/t$. We consider the equidistribution in $\mathbb T=\mathbb…

Number Theory · Mathematics 2026-05-22 Jérémy Champagne , Zhenchao Ge , Thái Hoàng Lê , Yu-Ru Liu , Trevor D. Wooley

There exists an infinite series of ratios by which one can derive the Riemann zeta function $\zeta(s)$ from Catalan numbers and central binomial coefficients which appear in the terms of the series. While admittedly the derivation is not…

Number Theory · Mathematics 2010-08-23 Robert J. Betts

In his study of Ramanujan-Sato type series for $1/\pi$, Sun introduced a sequence of polynomials $S_n(q)$ as given by $$S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k,$$ and he conjectured that the polynomials…

Combinatorics · Mathematics 2013-08-16 Donna Q. J. Dou , Anne X. Y. Ren

Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…

Combinatorics · Mathematics 2021-11-19 Jiangdong Ai , Stefanie Gerke , Gregory Gutin , Yacong Zhou

We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…

Combinatorics · Mathematics 2010-04-27 Christian Krattenthaler

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Number Theory · Mathematics 2012-03-06 Lior Bary-Soroker , Moshe Jarden

In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case…

Number Theory · Mathematics 2021-01-05 Symon Serbenyuk

We prove the following conjecture of Furstenberg (1969): if $A,B\subset [0,1]$ are closed and invariant under $\times p \mod 1$ and $\times q \mod 1$, respectively, and if $\log p/\log q\notin \mathbb{Q}$, then for all real numbers $u$ and…

Dynamical Systems · Mathematics 2019-02-08 Meng Wu

A beautiful recent conjecture of D. Armstrong predicts the average size of a partition that is simultaneously an $s$-core and a $t$-core, where $s$ and $t$ are coprime. Our goal is to prove this conjecture when $t=s+1$. These simultaneous…

Combinatorics · Mathematics 2015-04-03 Richard P. Stanley , Fabrizio Zanello

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…

Combinatorics · Mathematics 2020-07-07 Maciej Dołęga , Thomas Gerber , Jacinta Torres

We present a proof of the Casas-Alvero conjecture, stating that if a complex polynomial has a root in common with each of its derivatives it must be a multiple of the power of some monomial.

Algebraic Geometry · Mathematics 2015-11-20 Giulia Battiston

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…

Algebraic Geometry · Mathematics 2019-03-04 Dima Grigoriev
‹ Prev 1 8 9 10 Next ›