English
Related papers

Related papers: Framing Lattices and Flow Polytopes

200 papers

Maxwell lattices are characterized by an equal number of degrees of freedom and constraints. A subset of them, dubbed topological lattices, are capable of localizing stress and deformation on opposing edges, displaying a polarized…

Materials Science · Physics 2023-07-20 Mohammad Charara , Stefano Gonella

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…

Computational Geometry · Computer Science 2017-09-08 Therese Biedl , Veronika Irvine

In most systems, its division into interacting constituent elements gives rise to a natural network structure. Analyzing the dynamics of these elements and the topology of these natural graphs gave rise to the fields of (nonlinear) dynamics…

Classical Physics · Physics 2018-09-12 Sophia R. Sklan , Baowen Li

Recently K.-G. Grosse-Erdmann and D. Papathanasiou described hypercyclic shifts in weighted spaces on directed trees. In this note we discuss several simple examples of graphs which are not trees, e.g., the lattice graphs, and study…

Functional Analysis · Mathematics 2024-09-10 Anton Baranov , Andrei Lishanskii , Dimitris Papathanasiou

Graphs and hypergraphs combine expressive modeling power with algorithmic efficiency for a wide range of applications. Hedgegraphs generalize hypergraphs further by grouping hyperedges under a color/hedge. This allows hedgegraphs to model…

Data Structures and Algorithms · Computer Science 2025-10-30 Karthekeyan Chandrasekaran , Chandra Chekuri , Weihang Wang , Weihao Zhu

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

Computational Complexity · Computer Science 2009-11-10 Shmuel Friedland

This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…

Combinatorics · Mathematics 2007-05-23 Jonathan Fine

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

Combinatorics · Mathematics 2024-08-16 Tamás Kálmán , Lilla Tóthmérész

We report novel superlattice wave patterns at the interface of a fluid layer driven vertically. These patterns are described most naturally in terms of two interacting hexagonal sublattices. Two frequency forcing at very large aspect ratio…

chao-dyn · Physics 2009-10-31 A. Kudrolli , B. Pier , J. P. Gollub

We have found that the relation between the flow through campylotic (generically curved) media, consisting of randomly located curvature perturbations, and the average Ricci scalar of the system exhibits two distinct functional expressions…

Fluid Dynamics · Physics 2015-08-04 M. Mendoza , S. Succi , H. J. Herrmann

Flat-band physics has attracted much attention in recently years because of its interesting properties and important applications. Some typical lattices have been proposed to generate flat bands, such as Kagome and Lieb lattices. The flat…

Materials Science · Physics 2021-08-17 Siwen Li , Yuee Xie , Yuanping Chen

Linear polymers are represented as chains of hopping reptons and their motion is described as a stochastic process on a lattice. This admittedly crude approximation still catches essential physics of polymer motion, i.e. the universal…

Statistical Mechanics · Physics 2015-05-18 J. M. J. van Leeuwen , Andrzej Drzewinski

We construct a diagram D, indexed by a finite partially ordered set, of finite Boolean semilattices and (v,0,1)-embeddings, with top semilattice $2^4$, such that for any variety V of algebras, if D has a lifting, with respect to the…

Rings and Algebras · Mathematics 2007-05-23 Friedrich Wehrung , Jiri Tuma

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of…

Combinatorics · Mathematics 2024-08-16 Tamás Kálmán , Lilla Tóthmérész

Recently, a combinatorial interpretation of Baldoni and Vergne's generalized Lidskii formula for the volume of a flow polytope was developed by Benedetti et al.. This converts the problem of computing Kostant partition functions into a…

Combinatorics · Mathematics 2019-10-23 Martha Yip

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

We study a one-dimensional discrete analog of the von Karman flow, widely investigated in turbulence. A lattice of anharmonic oscillators is excited by both ends in order to create a large scale structure in a highly nonlinear medium, in…

Statistical Mechanics · Physics 2009-11-07 Michel Peyrard , Isabelle Daumont

The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…

Physics and Society · Physics 2015-05-20 R. Lambiotte , R. Sinatra , J. -C. Delvenne , T. S. Evans , M. Barahona , V. Latora

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas