English
Related papers

Related papers: Lattice paths and the Geode

200 papers

A finite group $G$, its group algebra $R[G]$ over the field of real numbers, any power series $p(t)= a_0+a_1t+ a_{2}t^{2}+ ...$, where $ a_i \geq 0$, and $a_0+a_1+ a_{2}+...= 1$, and simplex $$ S= \{x=\sum_{g\in G}x_gg\in R[G]: \sum_{g\in…

Dynamical Systems · Mathematics 2007-05-23 Ural Bekbaev , M. J. Mohamat Aidil

The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\} \] has interesting geometric properties. While it has a plentiful supply of complex geodesics and of automorphisms, there is nevertheless a unique complex geodesic…

Complex Variables · Mathematics 2020-04-28 Jim Agler , Zinaida Lykova , N. J. Young

The symmetrized bidisc \[ G \stackrel{\rm{def}}{=}\{(z+w,zw):|z|<1,\ |w|<1\}, \] under the Carath\'eodory metric, is a complex Finsler space of cohomogeneity $1$ in which the geodesics, both real and complex, enjoy a rich geometry. As a…

Differential Geometry · Mathematics 2020-12-08 Jim Agler , Zinaida Lykova , N. J. Young

Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…

Combinatorics · Mathematics 2017-03-30 Daniel Weißauer

Quantum and tensor network simulations have emerged as prominent sign-problem free approaches to lattice gauge theories. Unlike conventional Markov chain Monte Carlo methods, they are based on the Hamiltonian formulation. In this talk, we…

High Energy Physics - Lattice · Physics 2021-12-01 Angus Kan , Lena Funcke , Stefan Kühn , Luca Dellantonio , Jinglei Zhang , Jan F. Haase , Christine A. Muschik , Karl Jansen

We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…

Combinatorics · Mathematics 2007-09-27 Joseph P. S. Kung , Anna de Mier , Xinyu Sun , Catherine H. Yan

We introduce homotopy lattice gauge fields (HLGFs), a version of gauge fields over a discretized base, based on a notion of higher parallel transport that enriches the usual parallel transport along paths on a lattice to also consider…

Mathematical Physics · Physics 2026-03-23 Juan Orendain , Ivan Sanchez , José A. Zapata

The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…

Combinatorics · Mathematics 2007-05-23 David Austin , Heather Gavlas , Dave Witte

Let $H = \mathrm{SO}(n,1)$ and $A = \{a(t): t \in \mathbb{R}\}$ be a maximal $\mathbb{R}$-split Cartan subgroup of $H$. Let $\Gamma \subset H \times H$ be a nonuniform lattice in $H \times H$ and $X_{\Gamma} : = H \times H/ \Gamma$. Let…

Dynamical Systems · Mathematics 2019-05-02 Lei Yang

Let I = (F_1,...,F_r) be a homogeneous ideal of R = k[x_0,...,x_n] generated by a regular sequence of type (d_1,...,d_r). We give an elementary proof for an explicit description of the graded Betti numbers of I^s for any s \geq 1. These…

Commutative Algebra · Mathematics 2007-05-23 Elena Guardo , Adam Van Tuyl

An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my}. The set of these paths can be equipped with a lattice structure,…

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

Combinatorics · Mathematics 2007-05-23 Victor Batyrev

Two sharp existence and uniqueness theorems are presented for solutions of multiple vortices arising in a six-dimensional brane-world supersymmetric gauge field theory under the general gauge symmetry group $G=U(1)\times SU(N)$ and with $N$…

Analysis of PDEs · Mathematics 2015-06-04 Shouxin Chen , Yisong Yang

The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered. In this paper, the study of the…

Combinatorics · Mathematics 2018-10-10 Valentin Gledel , Vesna Iršič

We solve the Gauss law and the corresponding Mandelstam constraints in the loop Hilbert space ${\cal H}^{L}$ using the prepotential formulation of $(d+1)$ dimensional SU(2) lattice gauge theory. The resulting orthonormal and complete loop…

High Energy Physics - Lattice · Physics 2008-11-26 Manu Mathur

A geodesic is a shortest path which connects a pair of vertices of a graph G. In this paper we define the geodesic subpath number gpn(G) of a graph G as the number of geodesics in G. The number of subtrees and subpaths are already studied…

Combinatorics · Mathematics 2026-04-07 Martin Knor , Jelena Sedlar , Riste Škrekovski , Xiao-Dong Zhang

The main problem in the Hamiltonian formulation of Lattice Gauge Theories is the determination of an appropriate basis avoiding the over-completeness arising from Mandelstam relations. We short-cut this problem using Harmonic analysis on…

High Energy Physics - Lattice · Physics 2015-06-25 G. Burgio , R. De Pietri , H. A. Morales-Tecotl , L. F. Urrutia , J. D. Vergara

In reference [1] a unified description, both at the effective and fundamental Lagrangian level, of models of composite Higgs dynamics was proposed. In the unified framework the Higgs itself can emerge, depending on the way the electroweak…

High Energy Physics - Lattice · Physics 2015-06-19 Ari Hietanen , Randy Lewis , Claudio Pica , Francesco Sannino

A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…

Complex Variables · Mathematics 2022-04-13 A. Lastra , J. Sanz , J. R. Sendra

Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear…

Commutative Algebra · Mathematics 2022-09-30 Selvi Kara , Huy Tai Ha , Tran Nam Trung