Related papers: A Toroidal Maxwell-Cremona-Delaunay Correspondence
A curve $\gamma$ in a Riemannian manifold $M$ is three-dimensional if its torsion (signed second curvature function) is well-defined and all higher-order curvatures vanish identically. In particular, when $\gamma$ lies on an oriented…
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…
Let \(\T\) be a commutative ternary \(\Gm\)-semiring in the sense of the triadic, \(\Gm\)-parametrized multiplication \(\{a,b,c\}_{\gamma}\). Building on the affine \(\Gm\)-spectrum \(\SpecG(\T)\), the structure sheaf, and the equivalence…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
In this paper, we study sequences of perfect t-embeddings of a uniformly weighted family of graphs we call generalized tower graphs. We show that the embeddings of these graphs satisfy certain technical assumptions, in particular, the…
We give a necessary and sufficient condition for the mapping class group of the pair of the 3-sphere and a graph embedded in it to be isomorphic to the topological symmetry group of the embedded graph.
This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal…
We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…
This article develops a self-contained affine $\Gamma$-scheme theory for a class of commutative ternary $\Gamma$-semirings. By establishing all geometric and spectral results internally, the work provides a unified framework for triadic…
Learning efficient graph representation is the key to favorably addressing downstream tasks on graphs, such as node or graph property prediction. Given the non-Euclidean structural property of graphs, preserving the original graph data's…
In this paper we are interested in an intrinsic property of graphs which is derived from their embeddings into the Euclidean 3-space $\mathbb{R}^3$. An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if it sends every edge to…
The Grassmannian Gr(2,5) is embedded in $\Bbb{P}^9$ via the Pl\"ucker embedding. The intersection of two general PGL(10)-translates of Gr(2,5) is a Calabi-Yau 3-fold X, and the intersection of the projective duals of the two translates is…
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
Let $V$ be an $n$-dimensional vector space ($4\le n <\infty$) and let ${\mathcal G}_{k}(V)$ be the Grassmannian formed by all $k$-dimensional subspaces of $V$. The corresponding Grassmann graph will be denoted by $\Gamma_{k}(V)$. We…
We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…
The main aim of the article is to give a simple and conceptual account for the correspondence (originally described by Bodini, Gardy, and Jacquot) between $\alpha$-equivalence classes of closed linear lambda terms and isomorphism classes of…
In this work, we study various properties of embedded hypersurfaces in $1+1+2$ decomposed spacetimes with a preferred spatial direction, denoted $e^{\mu}$, which are orthogonal to the fluid flow velocity of the spacetime and admit a proper…
A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…
The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…