Related papers: Some notes on the regular graph defined by Schmidt…

Gerbner, Patk\'{o}s, Tuza, and Vizer recently initiated the study of $F$-saturated regular graphs. One of the essential problems in this line of research is determining when such a graph exists. Using generalized sum-free sets we prove that…

In this paper, we investigate the Bartholdi zeta function on a connected simple digraph with $n_V$ vertices and $n_E$ edges. We derive a functional equation for the Bartholdi zeta function $\zeta_G(q,u)$ on a regular graph $G$ with respect…

This paper continues a series of investigations on converging representations for the Riemann Zeta function. We generalize some identities which involve Riemann's zeta function, and moreover we give new series and integrals for the zeta…

We consider analytic functions of the Riemann zeta type, for which, if $s$ is a zero, so is $1-s$. We use infinite product representations of these functions, assuming their zeros to be of first order. We use exponential factors to…

In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…

We introduce new zeta functions related to an endomorphism $\phi$ of a discrete group $\Gamma$. They are of two types: counting numbers of fixed ($\rho\sim \rho\circ\phi^n$) irreducible representations for iterations of $\phi$ from an…

We give a sharp lower bound on the number of matchings of a given size in a bipartite graph. When specialized to regular bipartite graphs, our results imply Friedland's Lower Matching Conjecture and Schrijver's theorem proven by Gurvits and…

A common statistical task lies in showing asymptotic normality of certain statistics. In many of these situations, classical textbook results on weak convergence theory suffice for the problem at hand. However, there are quite some…

Shareshian-Wachs, Brosnan-Chow, and Guay-Pacquet [Adv. Math. ${\bf 295}$ (2016), ${\bf 329}$ (2018), arXiv:1601.05498] realized the chromatic (quasi-)symmetric function of a unit interval graph in terms of Hessenberg varieties. Here we…

Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…

We introduce the notion of Karamata regular operators, which is a notion of regularity that is suitable for obtaining concrete convergence rates for common fixed point problems. This provides a broad framework that includes, but goes…

Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

We develop a general theory of local stability up to belonging to an ideal (e.g. having measure zero). From a model-theoretic perspective, we prove a stationarity principle for almost stable formulas in this sense, and build a topological…

We derive normal approximation bounds in the Kolmogorov distance for sums of discrete multiple integrals and $U$-statistics made of independent Bernoulli random variables. Such bounds are applied to normal approximation for the renormalized…

Approximation in measure is employed to solve an asymptotic Dirichlet problem on arbitrary open sets and to show that many functions, including the Riemann zeta-function, are universal in measure. Connections with the Riemann Hypothesis are…

The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…