Related papers: The Strong Macdonald Conjecture
In this paper, we state as a conjecture a vector-valued Hopf-Dunford-Schwartz lemma and give a partial answer to it. As an application of this powerful result, we prove some Fe fferman-Stein inequalities in the setting of Dunkl analysis…
We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…
A constant term sequence is a sequence of rational numbers whose $n$-th term is the constant term of $P^n(\boldsymbol{x}) Q(\boldsymbol{x})$, where $P(\boldsymbol{x})$ and $Q(\boldsymbol{x})$ are multivariate Laurent polynomials. While the…
The Erd\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\epsilon(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least…
The $abc$ conjecture is a very deep concept in number theory with wide application to many areas of number theory. In this article we introduce the conjecture and give examples of its applications. In particular we apply the $abc$…
Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results
In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.
We prove the Extended Delta Conjecture of Haglund, Remmel, and Wilson, a combinatorial formula for $\Delta _{h_l}\Delta' _{e_k} e_{n}$, where $\Delta' _{e_k}$ and $\Delta_{h_l}$ are Macdonald eigenoperators and $e_n$ is an elementary…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…
Let A be an n-by-n matrix of real numbers which are weakly decreasing down each column, Z_n = diag(z_1,..., z_n) a diagonal matrix of indeterminates, and J_n the n-by-n matrix of all ones. We prove that per(J_nZ_n+A) is stable in the z_i,…
We prove a generalisation to any characteristic of a result of Macdonald that describes strict polynomial functors in characteristic zero in terms of representations of the groupoid of finite sets and bijections. Our result will give an…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…
We give a formal Laurent series proof of Andrews's $q$-Dyson Conjecture, first proved by Zeilberger and Bressoud.
In this work, we affirm the conjecture proposed by Gabriele Fici and Filippo Mignosi at the 10th Conference on Combinatorics on Words.
A version of Woodin's HOD dichotomy is proved assuming the existence of just one strongly compact cardinal.