English
Related papers

Related papers: Lattice paths and the Geode

200 papers

We propose an exact Hamiltonian lattice theory for (2+1)-dimensional spacetimes with homogeneous curvature. By gauging away the lattice we find a generalization of the ``polygon representation'' of (2+1)-dimensional gravity. We compute the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 A. Criscuolo , H. Waelbroeck

A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S \subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G) \setminus S$ by assigning a unique shortest path between each vertex pair of~$S$. In the…

Computational Complexity · Computer Science 2022-08-04 Carlos V. G. C. Lima , Vinicius F. dos Santos , João H. G. Sousa , Sebastián A. Urrutia

The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…

Combinatorics · Mathematics 2026-01-21 Manfred Buchacher

Given a lattice \Gamma in a locally compact group G and a closed subgroup H of G, one has a natural action of \Gamma on the homogeneous space V=H\G. For an increasing family of finite subsets {\Gamma_T: T>0}, a dense orbit v\Gamma, v\in V,…

Dynamical Systems · Mathematics 2016-09-07 Alexander Gorodnik , Barak Weiss

A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…

Logic · Mathematics 2019-06-14 Luigi Santocanale

In this article, we establish the relations between a sandpile graph, its sandpile monoid and the weighted Leavitt path algebra associated with it. Namely, we show that the lattice of all idempotents of the sandpile monoid $\text{SP}(E)$ of…

Rings and Algebras · Mathematics 2024-12-10 Roozbeh Hazrat , Tran Giang Nam

We show that an isometric action of a torsion-free uniform lattice $\Gamma$ on hyperbolic space $\mathbb{H}^n$ can be metrically approximated by geometric actions of $\Gamma$ on $\mathrm{CAT}(0)$ cube complexes, provided that either $n$ is…

Group Theory · Mathematics 2024-06-14 Nic Brody , Eduardo Reyes

Let $L_n$ be a line graph with $n$ vertices and let $I$ be its $t$-path ideal. It is shown that $I^s$ has a linear resolution for some $s\geq 1$ (or equivalently for all $s\geq 1$) if and only if $I^s$ has linear quotients for some $s\geq…

Commutative Algebra · Mathematics 2024-06-11 Jiawen Shan , Dancheng Lu

Let $\mathcal{M}_g$ be the moduli space of hyperbolic surfaces of genus $g$ endowed with the Weil-Petersson metric. In this paper, we show that for any $\epsilon>0$, as $g\to \infty$, for a generic surface in $\mathcal{M}_g$, the error term…

Geometric Topology · Mathematics 2025-06-06 Yunhui Wu , Yuhao Xue

We introduce lattice models with explicit N=2 supersymmetry. In these interacting models, the supersymmetry generators Q^+ and Q^- yield the Hamiltonian H={Q^+,Q^-} on any graph. The degrees of freedom can be described as either fermions…

High Energy Physics - Theory · Physics 2009-11-07 Paul Fendley , Kareljan Schoutens , Jan de Boer

Let $\{X_{v}:v\in\mathbb{Z}^d\}$ be i.i.d. random variables. Let $S(\pi)=\sum_{v\in\pi}X_v$ be the weight of a self-avoiding lattice path $\pi$. Let \[M_n=\max\{S(\pi):\pi\text{ has length }n\text{ and starts from the origin}\}.\] We are…

Probability · Mathematics 2024-01-30 Yinshan Chang , Anqi Zheng

Consider the group $\Ham^c(M)$ of compactly supported Hamiltonian symplectomorphisms of the symplectic manifold $(M,\om)$ with the Hofer $L^{\infty}$-norm. A path in $\Ham^c(M)$ will be called a geodesic if all sufficiently short pieces of…

Dynamical Systems · Mathematics 2015-06-26 François Lalonde , Dusa McDuff

The semidirect product of the real Heisenberg group ${\rm H}_1(\mathbb{R})$ with ${\rm SL}(2,\mathbb{R})$, called the real Jacobi group $G^J_1(\mathbb{R})$, admits a four-parameter invariant metric expressed in the S-coordinates. We…

Differential Geometry · Mathematics 2021-01-21 Stefan Berceanu

For a finite multigraph G, let \Lambda(G) denote the lattice of integer flows of G -- this is a finitely generated free abelian group with an integer-valued positive definite bilinear form. Bacher, de la Harpe, and Nagnibeda show that if G…

Combinatorics · Mathematics 2010-06-11 Yi Su , David G. Wagner

A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…

Combinatorics · Mathematics 2023-11-17 Maria Chudnovsky , Daniel Cizma , Nati Linial

It is proved that if $G$ is a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$ then either $G$ has a cycle of length at least $\min\{n,2\delta+4\}$ or $G$ is the Petersen graph.

Combinatorics · Mathematics 2012-03-19 Zh. G. Nikoghosyan

The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We…

Rings and Algebras · Mathematics 2026-04-21 Dolores Martín Barquero , Cándido Martín González , Iván Ruiz Campos

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

Combinatorics · Mathematics 2025-10-22 Sofia Brenner , Jean Cardinal , Thomas McConville , Arturo Merino , Torsten Mütze

Let $G$ be a graph of order $n$ with eigenvalues $\lambda_1 \geq \cdots \geq\lambda_n$. Let \[s^+(G)=\sum_{\lambda_i>0} \lambda_i^2, \qquad s^-(G)=\sum_{\lambda_i<0} \lambda_i^2.\] The smaller value, $s(G)=\min\{s^+(G), s^-(G)\}$ is called…

Combinatorics · Mathematics 2024-09-30 Saieed Akbari , Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada