English
Related papers

Related papers: Combinatorial Proof of Selberg's Integral Formula

200 papers

In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…

Number Theory · Mathematics 2026-03-16 Theophilus Agama

We give an alternative proof of the evaluation formula for the elliptic Selberg integral of type $BC_n$ as an application of the fundamental $BC_n$-invariants.

Complex Variables · Mathematics 2017-01-11 Masahiko Ito , Masatoshi Noumi

In 1967 Herbert Scarf suggested a new proof of Brouwer's fixed point theorem based on a combinatorial analogue of Sperner's lemma. Scarf presented his arguments in very geometric language, even purely combinatorial ones. Recently H. Petri…

Algebraic Topology · Mathematics 2022-07-26 Nikolai V. Ivanov

For a simple graph, we introduce a notion of the star sequence and prove that the star sequence and the frequently sequences of a graph are inverses of each other from a combinatorial point of view. As a consequence, we express the general…

Combinatorics · Mathematics 2018-09-19 Leonid Bedratyuk , Oleg Savenko

This paper has been withdrawn by the author as a more general result is known and could be referenced at "Combinatorial Enumeration" by Ian P. Goulden, David M. Jackson - Dover Publication 2004 - Section 3.3.13, Page 176.

Combinatorics · Mathematics 2009-10-07 Alok Bhushan Shukla

Several methods of evaluation are presented for a family of Selberg-like integrals that arose in the computation of the algebraic-geometric degrees of a family of multiplicity-free nilpotent K_C-orbits. First, adapting the technique of…

Representation Theory · Mathematics 2007-05-23 B. Binegar

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…

Combinatorics · Mathematics 2017-01-31 Eugene Curtin , Suho Oh

In this note, we present a simple directed graph proof of Sharkovsky's theorem.

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

We represent the universal Menger curve as the topological realization $|\mathbb{M}|$ of the projective Fra\"iss\'e limit ${\mathbb M}$ of the class of all finite connected graphs. We show that $\mathbb{M}$ satisfies combinatorial analogues…

Logic · Mathematics 2020-01-07 Aristotelis Panagiotopoulos , Slawomir Solecki

In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…

Rings and Algebras · Mathematics 2019-10-09 Peigen Cao , Fang Li

In this paper, we present two new representations of the alternating Zeta function. We show that for any s $\in$ C this function can be computed as a limit of a series of determinant. We then express these determinants as the expectation of…

Classical Analysis and ODEs · Mathematics 2022-03-21 Serge Iovleff

In this paper, we first generalize a theorem for counting the number of faces of an oriented embedding of a graph that passing through a given cut-edge set [S. Stahl, Trans. Amer. Math. Soc. 259 (1980), 129--145] to all surfaces. Then we…

Combinatorics · Mathematics 2022-05-03 Yichao Chen

Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…

Combinatorics · Mathematics 2014-01-08 Fu Liu

We provide a direct combinatorial proof of a Feynman graph identity which implies a wide generalization of a formality theorem by Kontsevich. For a Feynman graph $\Gamma$, we associate to each vertex a position $x_v \in \mathbb R$ and to…

Mathematical Physics · Physics 2025-06-12 Paul-Hermann Balduf , Davide Gaiotto

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

Logic · Mathematics 2017-04-18 Anush Tserunyan

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

Operator Algebras · Mathematics 2007-05-23 Jack Spielberg

By extending the new supersymmetric localization principle introduced in \cite{Choi:2021yuz}, we present a path integral derivation of the Selberg trace formula on arbitrary compact Riemann surfaces, including the case of arbitrary…

High Energy Physics - Theory · Physics 2025-03-03 Changha Choi , Leon A. Takhtajan

We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…

Combinatorics · Mathematics 2025-03-31 Jerónimo Valencia-Porras

We generalize Siegel's theorem on integral points on affine curves to integral points of bounded degree, giving a complete characterization of affine curves with infinitely many integral points of degree d or less over some number field.…

Number Theory · Mathematics 2019-02-20 Aaron Levin

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.

Number Theory · Mathematics 2022-01-28 Zihao Liu