Related papers: On a conjecture in bivariate interpolation
We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…
The Dinitz conjecture states that, for each $n$ and for every collection of $n$-element sets $S_{ij}$, an $n\times n$ partial latin square can be found with the $(i,j)$\<th entry taken from $S_{ij}$. The analogous statement for $(n-1)\times…
We formulate Guo--Jacquet type fundamental lemma conjectures and arithmetic transfer conjectures for inner forms of $GL_{2n}$. Our main results confirm these conjectures for division algebras of invariant $1/4$ and $3/4$.
Recently Braga and Mello conjectured that for a given natural number n there is a piecewise linear system with two zones in the plane with exactly n limit cycles. In this paper we prove a result from which the conjecture is an immediate…
We argue that the conclusion about the invalidity of the Dirac conjecture, made in the paper by Wang, Li, and Wang (Int. J. Theor. Phys. 48 1894, 2009), was based upon a flawed analysis of the proposed counterexamples. In the case of the…
In recent years important progress has been achieved towards proving the validity of the replica predictions for the (asymptotic) mutual information (or "free energy") in Bayesian inference problems. The proof techniques that have emerged…
We solve an interpolation problem for computing $\zeta(2n)$ in a rather elementary way, by generalizing the main idea in \cite{SE}.
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…
For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…
In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n]={1,...,n} which are shuffles of given disjoint ordered sequences…
We prove new cases of Fontaine-Mazur conjecture on two-dimensional Galois representations over Q when the residual representation is reducible. Our approach is via a semi-simple local-global compatibility of the completed cohomology and a…
Based on Casas-Alvero conjecture \textit{[J. Algebra, 2001]} we formulate the following conjecture.\\ \textbf{C*-algebraic Casas-Alvero Conjecture : Let $\mathcal{A}$ be a commutative C*-algebra, $n\in \mathbb{N}$ and let $P(z) =…
The purpose of the article is to provide partial proofs for two conjectures given by Witte and Forrester in "Moments of the Gaussian $\beta$ Ensembles and the large $N$ expansion of the densities" with the use of the topological recursion…
For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…
Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen…
The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…
It's well-known that there is a very powerful error bound for Gaussians put forward by Madych and Nelson in 1992. It's of the form$% | f(x)-s(x)| \leq (Cd)^{\frac{c}{d}}\left\Vert f\right\Vert_{h}$ where $C,c$ are constants, $h$ is the…
The article presents the proof of Casas-Alvero conjecture.
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…