Related papers: Combinatorial Proof of Selberg's Integral Formula

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

A carefully written Nirenberg's proof of the well known Gagliardo-Nirenberg interpolation inequality for intermediate derivatives in $\mathbb{R}^n$ seems, surprisingly, to be missing in literature. In our paper we shall first introduce this…

In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We produce new combinatorial methods for approaching the tropical maximal rank conjecture, including inductive procedures for deducing new cases of the conjecture on graphs of increasing genus from any given case. Using explicit…

In 1988, Gross proposed a conjectural congruence between Stickelberger elements and algebraic regulators, which is often referred to as the refined class number formula. In this paper, we prove this congruence.

In [Discrete Mathematics 306 (2005) 153-158], So proposed a conjecture saying that integral circulant graphs with different connection sets have different spectra. This conjecture is still open. We prove that this conjecture holds for…

Herbrand's theorem is often presented as a corollary of Gentzen's sharpened Hauptsatz for the classical sequent calculus. However, the midsequent gives Herbrand's theorem directly only for formulae in prenex normal form. In the Handbook of…

In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

A celebrated theorem of Selberg states that for congruence subgroups of SL(2,Z) there are no exceptional eigenvalues below 3/16. We prove a generalization of Selberg's theorem for infinite index "congruence" subgroups of SL(2,Z).…

In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

In analytic number theory, the Selberg--Delange Method provides an asymptotic formula for the partial sums of a complex function $f$ whose Dirichlet series has the form of a product of a well-behaved analytic function and a complex power of…

We prove a formula expressing a general n by n Toeplitz determinant as a Fredholm determinant of an operator 1-K acting on l_2({n,n+1,...}), where the kernel K admits an integral representation in terms of the symbol of the original…

We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…

It is shown that traces of mapping classes of finite order may be expressed by Verlinde-like formulae. The 3D topological argument is explained, and the resulting trace identities for modular matrix elements are presented.