English
Related papers

Related papers: Frises

200 papers

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…

Probability · Mathematics 2007-05-23 Alexander E. Holroyd , Yuval Peres

We develop a general framework of Euclidean patterns and pattern spaces of translational finite local complexity (FLC), analogues of translational tiling spaces. The notion of a self affine substitution of tilings is extended to both…

Dynamical Systems · Mathematics 2026-05-29 James J. Walton

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

Combinatorics · Mathematics 2024-04-26 Georg Grasegger , Jan Legerský

In the first half of the paper we construct a Morse-type theory on certain spaces of braid diagrams. We define a topological invariant of closed positive braids which is correlated with the existence of invariant sets of parabolic flows…

Dynamical Systems · Mathematics 2007-05-23 R. W. Ghrist , J. B. Van den Berg , R. C. Vandervorst

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

Geometric Topology · Mathematics 2014-10-01 Juan Gonzalez-Meneses , Bert Wiest

Let Q be a quiver without loops and 2-cycles, let A(Q) be the corresponding cluster algebra and let x be a cluster. We introduce a new class of integer vectors which we call frieze vectors relative to x. These frieze vectors are defined as…

Combinatorics · Mathematics 2020-11-03 Emily Gunawan , Ralf Schiffler

The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…

Combinatorics · Mathematics 2025-03-06 Pegah Pournajafi , Nicolas Trotignon

We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…

Number Theory · Mathematics 2022-04-20 Lenny Fukshansky , David Kogan

We investigate a cancellation property satisfied by a connected Eulerian digraph $D$. Namely, unless $D$ is a single directed cycle, we have $\sum_{k\geq 1} (-1)^{k} f_k(D)=0$, where $f_k(D)$ is the number of partitions of Eulerian circuits…

Combinatorics · Mathematics 2025-02-28 Joshua Cooper , Utku Okur

We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…

Mathematical Physics · Physics 2012-04-11 Paolo Aluffi , Matilde Marcolli

Let $(F,\le)$ be an ordered field and let $A,B$ be square matrices over $F$ of the same size. We say that $A$ and $B$ belong to the same archimedean class if there exists an integer $r$ such that the matrices $r A^T A-B^T B$ and $r B^T…

Rings and Algebras · Mathematics 2018-04-24 Jaka Cimpric

Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…

Geometric Topology · Mathematics 2016-02-11 Nicolau C. Saldanha , Pedro Zühlke

We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…

High Energy Physics - Theory · Physics 2020-02-18 Nima Arkani-Hamed , Song He , Thomas Lam , Hugh Thomas

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Discrete Mathematics · Computer Science 2015-03-12 Elisângela Silva Dias , Diane Castonguay , Mitre Costa Dourado

A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…

Complex Variables · Mathematics 2010-04-02 Sergei Favorov

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

Combinatorics · Mathematics 2007-05-23 Jason Burns

Positive definite matrices abound in a dazzling variety of applications. This ubiquity can be in part attributed to their rich geometric structure: positive definite matrices form a self-dual convex cone whose strict interior is a…

Functional Analysis · Mathematics 2013-12-31 Suvrit Sra

Let $\Delta$ be an oriented valued graph equipped with a group of admissible automorphisms satisfying a certain stability condition. We prove that the (coefficient-free) cluster algebra $\mathcal A(\Delta/G)$ associated to the valued…

Representation Theory · Mathematics 2009-01-30 G. Dupont

Consider a curve $\Gamma$ in a domain $D$ in the plane $\boldsymbol R^2$. Thinking of $D$ as a piece of paper, one can make a curved folding $P$ in the Euclidean space $\boldsymbol R^3$. The singular set $C$ of $P$ as a space curve is…

Differential Geometry · Mathematics 2020-07-23 Atsufumi Honda , Kosuke Naokawa , Kentaro Saji , Masaaki Umehara , Kotaro Yamada

By the Grid Minor Theorem of Robertson and Seymour, every graph of sufficiently large tree-width contains a large grid as a minor. Tree-width may therefore be regarded as a measure of 'grid-likeness' of a graph. The grid contains a long…

Combinatorics · Mathematics 2018-02-15 Daniel Weißauer
‹ Prev 1 3 4 5 6 7 10 Next ›