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

In the present paper, we give a proof of the gap-labelling conjecture for quasi-crystals. The main tools are the measured index theorem for laminations and a naturality of the longitudinal Chern character.

Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(G)+1)/2\rceil$ subsets so that each of them induces a forest of $G$. In this note, we prove this conjecture…

Eisenbud and Harris conjectured in 1982 that an algebraic curve of high genus lies on a surface of low degree (which they proved for curves of very large degree). They observed constraints on the Hilbert function of a general hyperplane…

Let A be an n-by-n matrix of real numbers which are weakly decreasing down each column, Z_n = diag(z_1,..., z_n) a diagonal matrix of indeterminates, and J_n the n-by-n matrix of all ones. We prove that per(J_nZ_n+A) is stable in the z_i,…

The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…

In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime.…

We prove an analog of the Deligne conjecture for prestacks. We show that given a prestack $\mathbb A$, its Gerstenhaber--Schack complex $\mathbf{C}_{\mathsf{GS}}(\mathbb A)$ is naturally an $E_2$-algebra. This structure generalises both the…

In this paper we study Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve. We present an upper bound on the gonality of the Cartesian product of any two graphs, and…

Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta(G)\lfloor \frac{1}{2}|V(H)| \rfloor$. Chetwynd and Hilton in 1986 conjectured that a graph $G$ with $\Delta(G)>\frac{1}{3}|V(G)|$…

In this article we use a theorem of Carlson and Griffiths and compute periods of linear algebraic cycles inside the Fermat variety of even dimension $n$ and degree $d$. As an application, for examples of $n$ and $d$ we prove that the locus…

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…

Let $X = G/H$ be an affine homogeneous spherical variety with abelian regular centralizer and no type N roots. In this paper, we formulate a relative geometric Langlands conjecture in the Dolbeault setting for $M = T^*X$. More concretely,…

Let $H$ be a nonabelian finite simple group. Huppert's conjecture asserts that if $G$ is a finite group with the same set of complex character degrees as $H$, then $G\cong H\times A$ for some abelian group $A$. Over the past two decades,…

Consider a sequence of LexBFS vertex orderings {\sigma}1, {\sigma}2, . . . where each ordering {\sigma}i is used to break ties for {\sigma}i+1. Since the total number of vertex orderings of a finite graph is finite, this sequence must end…

Characterizing graphs by their spectra is a fundamental and challenging problem in spectral graph theory, which has received considerable attention in recent years. A major unsolved conjecture in this area is Haemers' conjecture which…

Generalizing both Dirac's condition and Ore's condition for Hamilton cycles, Chv\'atal in 1972 established a degree sequence condition for the existence of a Hamilton cycle in a graph. Ho\`ang in 1995 generalized Chv\'atal's degree sequence…

We study the operator theory associated with such infinite graphs $G$ as occur in electrical networks, in fractals, in statistical mechanics, and even in internet search engines. Our emphasis is on the determination of spectral data for a…

In 1983, Borowiecki and J\'o\'zwiak posed the problem ``Characterize those graphs which have purely imaginary per-spectrum.'' This problem is still open. The most general result, although a partial solution, was given in 2004 by Yan and…