English
Related papers

Related papers: Laplacian Simplices Associated to Digraphs

200 papers

Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…

Combinatorics · Mathematics 2010-02-10 Roberto Imbuzeiro Oliveira

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

Combinatorics · Mathematics 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…

Combinatorics · Mathematics 2025-04-16 Sinan G. Aksoy , Stephen J. Young

Let $\Lambda$ be a simply laced root lattice and $w$ an elliptic automorphism of $\Lambda$ of order $d$. This paper gives a construction that begins with a central extension of the group of coinvariants $\Lambda_w$ and produces a semisimple…

Representation Theory · Mathematics 2020-11-04 Beth Romano

Let E be an integral lattice. We first discuss some general properties of an SDC lattice, i.e., a sum of two diagonal copies of E in E \bot E. In particular, we show that its group of isometries contains a wreath product. We then specialize…

Group Theory · Mathematics 2012-08-27 Robert L. Griess, , Ching Hung Lam

We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…

Algebraic Topology · Mathematics 2026-01-06 Ruizhi Huang

In the paper we show that for a normal-crossings degeneration $Z$ over the ring of integers of a local field with $X$ as generic fibre, the local monodromy operator and its powers determine invariant cocycle classes under the decomposition…

Algebraic Geometry · Mathematics 2007-05-23 Caterina Consani

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

Combinatorics · Mathematics 2020-01-22 Sarah Brauner , Forrest Glebe , David Perkinson

The paper considers systems of contraction similarities in $\mathbb R^d$ sending a given polyhedron $P$ to polyhedra $P_i\subset P$, whose non-empty intersections are singletons and contain the common vertices of those polyhedra, while the…

Metric Geometry · Mathematics 2017-07-11 Andrei Tetenov , Mary Samuel , Dmitry Vaulin

We study the matrices Q_k of in-forests of a weighted digraph G and their connections with the Laplacian matrix L of G. The (i,j) entry of Q_k is the total weight of spanning converging forests (in-forests) with k arcs such that i belongs…

Combinatorics · Mathematics 2007-05-23 Pavel Chebotarev , Rafig Agaev

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Combinatorics · Mathematics 2008-11-19 Fred J. Rispoli

We show that all stack-sorting polytopes are simplices. Furthermore, we show that the stack-sorting polytopes generated from $Ln1$ permutations have relative volume 1. We establish an upper bound for the number of lattice points in a…

Combinatorics · Mathematics 2025-08-04 Cameron Ake , Spencer F. Lewis , Amanda Louie , Andrés R. Vindas-Meléndez

Let $d \geq 2$ and $n\geq 3$ be two natural numbers. Given any sequence $\kappa=(k_1,\dots,k_n) \in \mathbb{Z}^n$ such that $\gcd(k_1,\dots,k_n,d)=1$, we consider the family of Riemann surfaces obtained from the plane curves defined by…

Geometric Topology · Mathematics 2024-11-19 Gabrielle Menet , Duc-Manh Nguyen

We present resent results regarding invertible, non-degenerate solutions of the set-theoretic Yang-Baxter and reflection equations. We recall the notion of braces and we present and prove various fundamental properties required for the…

Quantum Algebra · Mathematics 2025-05-21 Anastasia Doikou

Manifold submetries of the round sphere are a class of partitions of the round sphere that generalizes both singular Riemannian foliations, and the orbit decompositions by the orthogonal representations of compact groups. We exhibit a…

Differential Geometry · Mathematics 2020-02-10 Ricardo A. E. Mendes , Marco Radeschi

Building on previous work of Kadison--Ringrose, Elliott, Akemann--Pedersen, and this author, we prove a dichotomy for the relation of outer equivalence of derivations and unitary equivalence of derivable automorphisms for a separable…

Operator Algebras · Mathematics 2025-09-01 Martino Lupini

We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…

Logic in Computer Science · Computer Science 2022-01-27 Jan Dreier , Jakub Gajarský , Sandra Kiefer , Michał Pilipczuk , Szymon Toruńczyk

The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface $X(f)$. As $f$ diverges in the moduli space of polynomials,…

Dynamical Systems · Mathematics 2011-11-09 Laura G. DeMarco , Curtis T. McMullen

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

Geometric Topology · Mathematics 2013-10-15 Tamás László

The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…

Combinatorics · Mathematics 2022-05-06 Hui Gao , Daqing Yang