English
Related papers

Related papers: Geometry of unimodular systems

200 papers

We define a free uniformly complete vector lattice over a set of generators and give its concrete representation as a space of continuous positively homogeneous functions.

Functional Analysis · Mathematics 2025-06-17 Eduard Emelyanov , Svetlana Gorokhova

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

Combinatorics · Mathematics 2008-10-28 Maryam Atapour , Nasrin Soltankhah

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and…

Data Structures and Algorithms · Computer Science 2022-12-16 Thomas Bläsius , Tobias Friedrich , Maximilian Katzmann , Daniel Stephan

Let $\mathcal{C}$ be a finite tensor category and $\mathcal{M}$ an exact left $\mathcal{C}$-module category. We call $\mathcal{M}$ unimodular if the finite multitensor category ${\sf Rex}_{\mathcal{C}}(\mathcal{M})$ of right exact…

Quantum Algebra · Mathematics 2023-08-08 Harshit Yadav

It is shown that the description of certain class of representations of the holonomy Lie algebra associated to hyperplane arrangement $\Delta$ is essentially equivalent to the classification of $\vee$-systems associated to $\Delta.$ The…

Representation Theory · Mathematics 2017-04-17 M. V. Feigin , A. P. Veselov

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…

Computational Complexity · Computer Science 2009-07-02 Farzad Didehvar , Ali D. Mehrabi , Fatemeh Raee B

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

Dynamical Systems · Mathematics 2024-08-28 Davide Sclosa

We give a new short proof that the wheeled operad of unimodular Lie algebras is Koszul and use this to explicitly construct its minimal resolution. A representation of this resolution in a finite dimensional vector space V we call a…

Quantum Algebra · Mathematics 2008-03-13 Johan Granåker

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

Commutative Algebra · Mathematics 2017-11-06 Rameez Raja

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

Combinatorics · Mathematics 2025-12-10 Csilla Bujtás , Sandi Klavžar , Jing Tian

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…

Data Structures and Algorithms · Computer Science 2017-07-14 Khaled Elbassioni , Kazuhisa Makino

An independent set $I$ in a graph $G$ is maximal if $I$ is not properly contained in any other independent set of $G$. The study of maximal independent sets (MIS's) in various graphs is well-established, often focusing upon enumeration of…

Combinatorics · Mathematics 2025-06-30 Levi Axelrod , Nathan Bickel , Anastasia Halfpap , Luke Hawranick , Alex Parker , Cole Swain

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

Combinatorics · Mathematics 2025-04-22 Christin Bibby

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

Combinatorics · Mathematics 2016-02-29 Aistis Atminas , Viktor Zamaraev

We introduce a higher-uniformity analogue of graphic zonotopes and permutohedra. Specifically, given a $(d+1)$-uniform hypergraph $H$, we define its hypergraphic zonotope $\mathcal{Z}_H$, and when $H$ is the complete $(d+1)$-uniform…

Combinatorics · Mathematics 2025-03-28 Cosmin Pohoata , Daniel G. Zhu

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

Number Theory · Mathematics 2021-05-13 Kathrin Bringmann , Chris Jennings-Shaffer , Antun Milas

A thorough study and analysis on the conceptual foundations of unimodular gravity shows that this theory is essentially general relativity disguised as unimodular relativity in the literature. The main reason for this dilemma is accepting…

General Physics · Physics 2023-06-09 S. C. Tiwari

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…

Differential Geometry · Mathematics 2016-03-03 Tracy L. Payne , Matthew Schroeder

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. We consider the zero divisor graph…

Rings and Algebras · Mathematics 2020-01-07 B. Surendranath Reddy , Rupali S. Jain , N. Laxmikanth
‹ Prev 1 3 4 5 6 7 10 Next ›