Related papers: Lattice paths and the Geode

The article establishes a long list of rigidity properties of lattices in G = SO(n,1) with n>=3 and G = SU(n,1) with n>=2 that are analogous to superrigidity of lattices in higher-rank Lie groups. The arguments are set in the context of…

If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct…

The signature of a path is a sequence of tensors which allows to uniquely reconstruct the path. By employing the geometric theory of nonlinear systems of ordinary differential equations, we find necessary and sufficient algebraic conditions…

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

Let S be a connected scheme smooth and of finite type over the field of complex numbers. To every 1-motive over S, Andr\'e associated the enriched Hodge realization given by a torsion-free, graded-polarizable and admissible variation of…

When continuous fields are expanded in a wavelet basis, a D-dimensional continuum action becomes a (D+1)-dimensional lattice action on the naively discretized Poincare-patch coordinates of an Euclidean AdS(D+1). New possible criteria for…

Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…

Higher-form symmetry in a tensor product Hilbert space is always emergent: the symmetry generators become genuinely topological only when the Gauss law is energetically enforced at low energies. In this paper, we present a general method…

It is a classical fact that domains of convergence of power series of several complex variables are characterized as logarithmically convex complete Reinhardt domains; let $D \subsetneq \mathbb{C}^N$ be such a domain. We show that a…

For an $n$-vertex graph $G$, the walk matrix of $G$, denoted by $W(G)$, is the matrix $[e,A(G)e,\ldots,(A(G))^{n-1}e]$, where $A(G)$ is the adjacency matrix of $G$ and $e$ is the all-ones vector. For two integers $m$ and $\ell$ with $1\le…

We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic…

A set S of vertices of a connected graph G is convex, if for any pair of vertices u; v 2 S, every shortest path joining u and v is contained in S . The convex hull CH(S) of a set of vertices S is defined as the smallest convex set in G…

For a compact set $E \subset \mathbb R^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k+1$ points in $E$ such that the distance between a pair of points is specified if the corresponding…

A Hamiltonian lattice formulation of lattice gauge theories opens the possibility for quantum simulations of the non-perturbative dynamics of QCD. By parametrizing the gauge invariant Hilbert space in terms of plaquette degrees of freedom,…

A graph $G$ belongs to the class ${\rm ORTH}[h,s,t]$ for integers $h$, $s$, and $t$ if there is a pair $(T,{\cal S})$, where $T$ is a tree of maximum degree at most $h$, and ${\cal S}$ is a collection $(S_u)_{u\in V(G)}$ of subtrees $S_u$…

We study the generalized roundness of finite metric spaces whose distance matrix $D$ has the property that every row of $D$ is a permutation of the first row. The analysis provides a way to characterize subsets of the Hamming cube $\{ 0, 1…

We develop the $(1+1)$d lattice $U(1)$ gauge theory in order to define $2$-flavor massless Schwinger model, and discuss its connection with Haldane conjecture. We propose to use the central-branch Wilson fermion, which is defined by…

Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…

In this paper, we study long paths and Hamiltonian paths in inhomogenous random graphs. In the first part of the paper, we consider an inhomogenous Erd\H{o}s-R\'enyi random graph $G_E$ with average edge density $p_n.$ We prove that if…

Spatially-periodic patterns are studied in nonlocally coupled Gross-Pitaevskii equation. We show first that spatially periodic patterns appear in a model with the dipole-dipole interaction. Next, we study a model with a finite-range…