Related papers: Quadratic Generated Normal Domains From Graphs
We consider the natural monoid structure on the set of quadratic rings over an arbitrary base scheme and characterize this monoid in terms of discriminants.
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Hence, the task is formalized as maximum common subgraph…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
In this paper we give a combinatorial description of the renormlization limits of infinitely renormalizable unimodal maps with {\it essentially bounded} combinatorics admitting quadratic-like complex extensions. As an application we…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
We determine all Hermitian $\mathcal{O}_{\Q(\sqrt{d})}$-matrices for which every eigenvalue is in the interval [-2,2], for each d in {-2,-7,-11,-15\}. To do so, we generalise charged signed graphs to $\mathcal{L}$-graphs for appropriate…
Motivated by some known problems concerning combinatorial structures associated with finite one-dimensional affine permutation groups, we study subgroups which are closed in $\operatorname{\Gamma{L}}_1(q)$. This brings us to a description…
We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…
The Ehrhart ring of the edge polytope $\mathcal{P}_G$ for a connected simple graph $G$ is known to coincide with the edge ring of the same graph if $G$ satisfies the odd cycle condition. This paper gives for a graph which does not satisfy…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
For $\textbf{r}=(r_1,\ldots,r_k)$, an $\textbf{r}$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of the edges of $\lambda K_n^h$ into $F_1,\ldots, F_k$ such that $F_j$ is…
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…
An integral domain $R$ is \emph{perinormal} if every local going-down overring is a localization of $R$ and \emph{globally perinormal} if every going-down overring is a localization of $R$. In this paper, I introduce notions of graded…
In this work, we introduce the boundary polynomial of a graph $G$ as the ordinary generating function in two variables $B(G;x,y):= \displaystyle\sum_{S\subseteq V(G)} x^{|B(S)|}y^{|S|}$, where $B(S)$ denotes the outer boundary of $S$. We…
The chromatic symmetric function $X_G$ is a sum of monomials corresponding to proper vertex colorings of a graph $G$. Crew, Pechenik, and Spirkl (2023) recently introduced a $K$-theoretic analogue $\overline{X}_G$ called the Kromatic…
The compressed zero-divisor graph $\Gamma_C(R)$ associated with a commutative ring $R$ has vertex set equal to the set of equivalence classes $\{ [r] \mid r \in Z(R), r \neq 0 \}$ where $r \sim s$ whenever $ann(r) = ann(s)$. Distinct…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
A matroid is $\text{GF}(q)$-regular if it is representable over all proper superfields of the field $\text{GF}(q)$. We show that, for highly connected matroids having a large projective geometry over $\text{GF}(q)$ as a minor, the property…
Deep generative models have achieved remarkable success in various data domains, including images, time series, and natural languages. There remain, however, substantial challenges for combinatorial structures, including graphs. One of the…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…