Related papers: Geometry of unimodular systems
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…
A Riemannian orbifold is a mildly singular generalization of a Riemannian manifold that is locally modeled on $R^n$ modulo the action of a finite group. Orbifolds have proven interesting in a variety of settings. Spectral geometers have…
This article lays the foundations for the study of modular forms transforming with respect to representations of Fuchsian groups of genus zero. More precisely, we define geometrically weighted graded modules of such modular forms, where the…
A n n-body system is a labelled collection of n point masses in Euclidean space, and their congruence and internal symmetry properties involve a rich mathematical structure which is investigated in the framework of equivariant Riemannian…
Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We propose a modular, data-driven framework for jointly learning unknown functional mappings and discovering the underlying one-parameter symmetry subgroup governing the data. Unlike conventional geometric deep learning methods that assume…
A complex system comprises multiple interacting entities whose interdependencies form a unified whole, exhibiting emergent behaviours not present in individual components. Examples include the human brain, living cells, soft matter, Earth's…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…
A transformation is obtained which completes the unification of quadrirational Yang-Baxter maps and known integrable multi-quadratic quad equations. By combining theory from these two classes of quad-graph models we find an extension of the…
Given a family of varieties, the Euler discriminant locus distinguishes points where Euler characteristic differs from its generic value. We introduce a hypergeometric system associated with a flat family of very affine locally complete…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
Hyperbolic neural networks can effectively capture the inherent hierarchy of graph datasets, and consequently a powerful choice of GNNs. However, they entangle multiple incongruent (gyro-)vector spaces within a layer, which makes them…
A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph $G$ is called uniformly well-covered if there is a partition of the set of vertices of $G$ such that each maximal…
In this paper, nonzero component graphs and nonzero component union graphs of finite dimensional vector space are studied using the zero-divisor graph of specially constructed 0-1-distributive lattice and the zero-divisor graph of rings.…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tree.…
If Y is a diagram of spectra indexed by an arbitrary poset C together with a specified sub-poset D, we define the total cofibre \Gamma (Y) of Y as the strict cofibre of the map from hocolim_D (Y) to hocolim_C (Y). We construct a comparison…