Related papers: On Chollet's Permanent Conjecture for Graph Laplac…

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

We conjecture a multi-parameter generalization of the toric inequalities of \cite{Czech:2023xed}. We then extend their proof methods for the generalized toric inequalities in two ways. The first extension constructs the graph corresponding…

Let $H$ be a positive semi-definite matrix partitioned in $\beta\times \beta$ Hermitian blocks, $H=[A_{s,t}]$, $1\le s,t,\le \beta$. Then, for all symmetric norms, {equation*} \| H \| \le \| \sum_{s=1}^{\beta} A_{s,s} \|. {equation*} The…

Following the work of Harris and Kudla we prove a more general form of a conjecture of Jacquet relating the non-vanishing of a certain period integral to non-vanishing of the central critical value of a certain $L$-function. As a…

We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…

Haemers conjectures that almost all graphs are determined by their spectra. Suppose $G \sim \mathcal{G}(n, p)$ is a random graph with each edge chosen independently with probability $p$ with $0 < p < 1$. Then $$\Pr(G \text{ is not…

This paper investigates the principal minors of a parameterized Hermitian Laplacian matrix for oriented graphs. Particularly, we focus on the properties of the matrix for parameters chosen as Galois conjugates of a primitive $p$th root of…

Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…

Many important problems in extremal combinatorics can be be stated as proving a pure binomial inequality in graph homomorphism numbers, i.e., proving that…

Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…

In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…

A graph is determined by its signless Laplacian spectrum if there is no other non-isomorphic graph sharing the same signless Laplacian spectrum. Let $C_l$, $P_l$, $K_l$ and $K_{s,l-s}$ be the cycle, the path, the complete graph and the…

In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…

We formulate a tropical analogue of Grothendieck's section conjecture: that for every stable graph G of genus g>2, and every field k, the generic curve with reduction type G over k satisfies the section conjecture. We prove many cases of…

Given a graph $G$ and a subset $X$ of vertices of $G$ with size at least two, we denote by $N^2_G(X)$ the set of vertices of $G$ that have at least two neighbors in $X$. We say that a bipartite graph $G$ with sides $A$ and $B$ satisfies the…

The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into $\ell_1$ with uniformly bounded distortions. This result answers the problem posed by N.…

We prove several results about integral versions of Fourier duality for abelian schemes, making use of Pappas's work on integral Grothendieck-Riemann-Roch. If $S$ is smooth quasi-projective of dimension $d$ over a field and $\pi \colon X\to…

We establish an analogue of the Grothendieck inequality where the rectangular matrix is replaced by a symmetric/Hermitian matrix and the bilinear form by a quadratic form. We call this the symmetric Grothendieck inequality; despite its…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…