English
Related papers

Related papers: Another proof of the alternating sign matrix conje…

200 papers

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Combinatorics · Mathematics 2026-03-20 Ilya I. Bogdanov , Fedor Petrov , Anton Sadovnichiy , Fedor Ushakov

We prove K-theoretic generalizations of the component formulas of Knutson, Miller, and Shimozono, and deduce that K-theoretic quiver coefficients have alternating signs. We also prove new variants of the factor sequences conjecture, and a…

Combinatorics · Mathematics 2007-05-23 Anders Skovsted Buch

We study the partition function for the three-colour model with domain wall boundary conditions. We express it in terms of certain special polynomials, which can be constructed recursively. Our method generalizes Kuperberg's proof of the…

Combinatorics · Mathematics 2014-06-16 Hjalmar Rosengren

Auslander-Reiten conjecture, which says that an Artin algebra does not have any non-projective generator with vanishing self-extensions in all positive degrees, is shown to be invariant under certain singular equivalences induced by adjoint…

Representation Theory · Mathematics 2020-11-06 Yiping Chen , Wei Hu , Yongyun Qin , Ren Wang

In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

Number Theory · Mathematics 2025-10-29 Saša Novaković

We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…

Exactly Solvable and Integrable Systems · Physics 2024-04-12 Pavlos Kassotakis

The Tijdeman-Zagier conjecture states no integer solution exists for $A^X+B^Y=C^Z$ with positive integer bases and integer exponents greater than 2 unless gcd$(A,B,C)>1$. Any set of values that satisfy the conjecture correspond to a lattice…

Number Theory · Mathematics 2021-03-16 David Hauser , Ian Hauser

The spectra of recently constructed auxiliary matrices for the six-vertex model respectively the spin s=1/2 Heisenberg chain at roots of unity q^N=1 are investigated. Two conjectures are formulated both of which are proven for N=3 and are…

Mathematical Physics · Physics 2009-11-10 Christian Korff

We find and prove relationships between Riemann zeta values and central binomial sums. We also investigate alternating binomial sums (also called Ap\'ery sums). The study of non-alternating sums leads to an investigation of different types…

High Energy Physics - Theory · Physics 2007-05-23 J. M. Borwein , D. J. Broadhurst , J. Kamnitzer

Erd\"os and Obl\'ath proved that the equation $n!\pm m!=x^p$ has only finitely many integer solutions. More general, under the ABC-conjecture, Luca showed that $P(x)=An!+Bm!$ has finitely many integer solutions for polynomials of degree…

Number Theory · Mathematics 2023-09-27 Saša Novaković

We prove that if a $7\times 7$ matrix is potentially stable, then it has at least 11 non-zero entries. The results for $n\times n$ matrix with $n$ up to 6 are known previously. We prove the result by making a list of possible associated…

Combinatorics · Mathematics 2018-05-24 Christopher Hambric , Chi-Kwong Li , Diane Christine Pelejo , Junping Shi

Ap\'{e}ry-type (inverse) binomial series have appeared prominently in the calculations of Feynman integrals in recent years. In our previous work, we showed that a few large classes of the non-alternating Ap\'ery-type (inverse) central…

Number Theory · Mathematics 2025-08-06 Ce Xu , Jianqiang Zhao

A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…

Combinatorics · Mathematics 2020-08-05 Edita Máčajová , Martin Škoviera

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

Combinatorics · Mathematics 2025-12-23 Saieed Akbari , Clive Elphick , Hitesh Kumar , Shivaramakrishna Pragada , Quanyu Tang

We show that under reasonable conditions, a random $n\times (2+\epsilon) n$ integer matrix is surjective on $\mathbb{Z}^{n}$ with probability $1-O(e^{-cn})$. We also conjecture that this should hold for $n\times (1+\epsilon)n$, and provide…

Combinatorics · Mathematics 2019-12-16 Shaked Koplewitz

We introduce new methods to describe admissible states of the six-vertex and the eight-vertex lattice models of statistical mechanics. For the six-vertex model, we view the admissible states as differential forms on a grid graph. This…

Combinatorics · Mathematics 2022-07-28 Kedar Karhadkar

We prove upper and lower bounds on the number of pairs of commuting $n\times n$ matrices with integer entries in $[-T,T]$, as $T\to \infty$. Our work uses Fourier analysis and leads us to an analysis of exponential sums involving matrices…

Number Theory · Mathematics 2025-11-18 Tim Browning , Will Sawin , Victor Y. Wang

We show that the poset of alternating sign matrices, with Bruhat order, is isomorphic to the poset of certain submodules of the dominant Verma module for the special linear Lie algebra $\frak{sl}_n$. The latter poset consists of the…

Representation Theory · Mathematics 2021-08-18 Hankyung Ko

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…

Combinatorics · Mathematics 2018-02-16 Torsten Mütze