Related papers: Unimodular graphs and Eisenstein sums
We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing…
We give a geometric perspective on the algebra of Drinfeld modular forms for congruence subgroups $\Gamma\leq \GL_2(\bbF_q[T]).$ In particular, we describe an isomorphism between the section ring of a line bundle on the stacky modular curve…
I show that a summation over ribbon graphs with legs gives the construction of the solutions to the noncommutative Batalin-Vilkovisky equation, including the equivariant version. This generalizes the known construction of A-infinity algebra…
Let $\Sigma$ be a finite type surface, and $G$ a complex algebraic simple Lie group with Lie algebra $\mathfrak{g}$. The quantum moduli algebra of $(\Sigma,G)$ is a quantization of the ring of functions of $X_G(\Sigma)$, the variety of…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
We consider the configuration model and the uniform simple graph with given degree sequence $\boldsymbol{d}=\left(d_i\right)_{i=1}^n$. We derive quantitative bounds for the errors in (i) joint normal-Poisson approximation to the numbers of…
The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
We derive here the Friedland-Tverberg inequality for positive hyperbolic polynomials. This inequality is applied to give lower bounds for the number of matchings in $r$-regular bipartite graphs. It is shown that some of these bounds are…
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, we study the bounds on the sum and product of the independence numbers of graphs and their line…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
We introduce a streamlined method for evaluating in-in loop integrals using dimensional regularization for diagrams with an arbitrary number of external legs and vertices, which complements earlier work and facilitates the extraction of the…
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…
The mathematical formalism necessary for the diagramatic evaluation of quantum corrections to a conformally invariant field theory for a self-interacting scalar field on a curved manifold with boundary is considered. The evaluation of…