English
Related papers

Related papers: On Zeilberger Conjecture

200 papers

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bruno Gauthier

This paper studies Zeilberger's two prized constant term identities. For one of the identities, Zeilberger asked for a simple proof that may give rise to a simple proof of Andrews theorem for the number of totally symmetric self…

Combinatorics · Mathematics 2011-06-27 Guoce Xin

We give a conjectured evaluation of the determinant of a certain matrix $\tilde{D}(n,k)$. The entries of $\tilde{D}(n,k)$ are either 0 or specializations $\mathfrak{S}_w(1,\dots,1)$ of Schubert polynomials. The conjecture implies that the…

Combinatorics · Mathematics 2017-04-06 Richard P. Stanley

Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…

General Mathematics · Mathematics 2019-12-13 Venkatesulu Mandadi , Devi Paramwswari

We give a short proof of Belaga's result on bounds to perigees of $(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle conjecture which is rather a algorithmic problem into a purely arithmetic problem.

Number Theory · Mathematics 2014-09-23 Masayoshi Kaneda

The cycle double cover conjecture states that a graph is bridge-free if and only if there is a family of edge-simple cycles such that each edge is contained in exactly two of them. It was formulated independently by Szekeres (1973) and…

Discrete Mathematics · Computer Science 2012-02-08 Alexander Souza

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

Number Theory · Mathematics 2026-05-29 Yutong Zhang , Yaoran Yang

The article provides a counterexample to a conjecture by Blocki-Zwonek.

Complex Variables · Mathematics 2015-07-20 John Erik Fornæss

We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all…

Classical Analysis and ODEs · Mathematics 2025-07-01 Olga Kushel , Mikhail Tyaglov

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…

Logic in Computer Science · Computer Science 2024-02-16 Yukihiro Oda , James Brotherston , Makoto Tatsuta

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

Combinatorics · Mathematics 2010-05-03 Richard P. Brent , Brendan D. McKay

In this paper we investigate the permanent of $(-1,1)$-matrices over fields of zero characteristics and our main goal is to provide a sharp upper bound for the value of the permanent of such matrices depending on matrix rank, solving Wang's…

Combinatorics · Mathematics 2018-10-11 Mikhail V. Budrevich , Alexander E. Guterman

This note is about an old conjecture of Voisin, which concerns zero--cycles on the self-product of surfaces of geometric genus one. We prove this conjecture for surfaces with $p_g=1$ and $q=2$.

Algebraic Geometry · Mathematics 2016-11-29 Robert Laterveer

Pausinger recently investigated a special determinant involving prime numbers. In this short note we point out that this type of determinants was already known in linear algebra and its computation is unrelated to prime numbers.

General Mathematics · Mathematics 2025-12-25 Huan Xiao

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

Combinatorics · Mathematics 2007-12-04 Kouachi Said , Abdelmalek Salem , Rebiai Belgacem

Let $X$ be the product of a surface satisfying $b_2=\rho$ and of a curve over a finite field. We study a strong form of the integral Tate conjecture for $1$-cycles on $X$. We generalize and give unconditional proofs of several results of…

Algebraic Geometry · Mathematics 2025-07-23 Federico Scavia

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…

History and Overview · Mathematics 2022-10-11 Donsub Rim

In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of $n \times n$ alternating sign matrices with a 1 at the top of the $i$-th column. We give an alternative…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer

We prove a conjecture of H.Widom stated in [W] (math/0108008) about the reality of eigenvalues of certain infinite matrices arising in asymptotic analysis of large Toeplitz determinants. As a byproduct we obtain a new proof of A.Okounkov's…

Combinatorics · Mathematics 2009-11-11 Alexei Borodin , Alexei Novikov

We show that the Seiberg-Witten map for a noncommutative gauge theory involves a noncommutative 1-cocycle. The cocycle condition enforces a consistency requirement, which has been previously derived.

High Energy Physics - Theory · Physics 2009-11-07 R. Jackiw , S. -Y. Pi