Related papers: Serre's Properties for Quadratic Generated Domains…
In this paper, we build properly embedded singly periodic minimal surfaces which have infinite total curvature in the quotient by the period. These surfaces are constructed by adding a handle to the toroidal half-plane layers defined by H.…
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where…
A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_1, \dots, X_k$, such that for all $i \in \{1,\dots,k\}$, the set $X_i$ can be ordered as $X_i = \{u_i^1, \dots, u_i^{|X_i|}\}$ so that $X_i…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
This paper aims at constructing a good graph for discovering intrinsic data structures in a semi-supervised learning setting. Firstly, we propose to build a non-negative low-rank and sparse (referred to as NNLRS) graph for the given data…
Let $G$ be a graph on $[n]$ and $J_G$ be the binomial edge ideal of $G$ in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate some topological properties of a poset associated to the minimal…
We introduce graph potentials, which are Laurent polynomials associated to (colored) trivalent graphs. We show that the birational type of the graph potential only depends on the homotopy type of the colored graph, and use this to define a…
An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
In the present paper, we give a complete classification of connected simple graphs whose edge rings have a $q$-linear resolution with $q \geq 2$. In particular, we show that the edge ring of a finite connected simple graph with a $q$-linear…
We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$, there exists an integer $t=t(k,H)$ so that every graph $G$ either has a vertex-minor isomorphic to the disjoint union of $k$ copies of $H$, or…
A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
We consider a pair of semigroups associated to a signed poset, called the root semigroup and the weight semigroup, and their semigroup rings, $R_P^\mathrm{rt}$ and $R_P^\mathrm{wt}$, respectively. Theorem 4.1.5 gives generators for the…
We consider algebras over a field K defined by a presentation K <x_1,..., x_n : R >, where $R$ consists of n choose 2 square-free relations of the form x_i x_j = x_k x_l with every monomial x_i x_j, i different from j, appearing in one of…
We consider Borcherds superalgebras obtained from semisimple finite-dimensional Lie algebras by adding an odd null root to the simple roots. The additional Serre relations can be expressed in a covariant way. The spectrum of generators at…
We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of K\"{o}nig type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
We classify the graphs that can occur as the graph of rational preperiodic points of a quadratic polynomial over $\bold Q$, assuming the conjecture that it is impossible to have rational points of period $4$ or higher. In particular, we…
Let $K$ be a field, let $\sigma$ be an automorphism of $K$, and let $\delta$ be a derivation of $K$. We show that if $D$ is one of $K(x;\sigma)$ or $K(x;\delta)$, then $D$ either contains a free algebra over its center on two generators, or…