arXiv research

Principal binets generalize curvature line surfaces to square lattices and are a discrete integrable system.

Proves effective slope gaps for lattice surfaces.

We give a shorter and simpler proof of the result of [2], which gives a necessary and sufficient condition for when a lattice diagram is the projection of a lattice link.

The moduli space of lattices of $\mathbb{C}$ is a Riemann surface of finite hyperbolic area with the square lattice as an origin. We select a lattice from the induced uniform distribution and calculate the statistics of the Teichmüller distance to the origin. This in turn identifies distribution of the distance in Teic…

New lattices in higher rank contain a fixed 3-manifold group with increasing systole.

We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building associated to a graph product of finite groups, a uniform lattice is commensurable with…

Estimates eigenvalues of poly-Laplace operator on lattice subgraphs.

Algorithm constructs surfaces with specific Veech groups in lattice strata.

We study the motion of discrete interfaces driven by ferromagnetic interactions on the two-dimensional triangular lattice by coupling the Almgren, Taylor and Wang minimizing movements approach and a discrete-to-continuum analysis, as introduced by Braides, Gelli and Novaga in the pioneering case of the square lattice. …

In this paper, we address the issue of quaternionic Toledo invariant to study the character variety of two dimensional complex hyperbolic uniform lattices into $SU(n,2)$. We construct four distinct representations to prove that the character variety contains at least four distinct components. We also address the existe…

A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the weighted number of convex tilings with a given number of tiles. To prove these for…

To a compact Riemann surface of genus g can be assigned a principally polarized abelian variety (PPAV) of dimension g, the Jacobian of the Riemann surface. The Schottky problem is to discern the Jacobians among the PPAVs. Buser and Sarnak showed, that the square of the first successive minimum, the squared norm of the …

Building on work of Kapouleas and Yang, we construct sequences of minimal surfaces embedded in the round 3-sphere which converge to the Clifford torus counted with multiplicity two and have second fundamental form blowing up at every point of the torus and genus tending to infinity. Each surface in a given sequence res…

We construct embedded closed minimal surfaces in the round three-sphere, resembling two parallel copies of the Clifford torus, joined by m^2 small catenoidal bridges symmetrically arranged along a square lattice of points on the torus.

Novel trading strategy for generalized lattice markets ensures positive profits.

Inspired by the human visual perception system, hexagonal image processing in the context of machine learning deals with the development of image processing systems that combine the advantages of evolutionary motivated structures based on biological models. While conventional state-of-the-art image processing systems o…

A microscopic approach to macroeconomic features is intended. A model for macroeconomic behavior under heterogeneous spatial economic conditions is reviewed. A birth-death lattice gas model taking into account the influence of an economic environment on the fitness and concentration evolution of economic entities is nu…

A discrete conformal map (DCM) maps the square lattice to the Riemann sphere such that the image of every irreducible square has the same cross-ratio. This paper shows that every periodic DCM can be determined from spectral data (a hyperelliptic compact Riemann surface, called the spectral curve, equipped with some mar…

Data compression speeds up machine learning loss calculations.

We prove a sharp estimate on the expected value of the integral of the index of a simple random walk on the square or triangular lattice. This gives new lower bounds on the averaged Dehn function, which measures the expected area needed to fill a random curve with a disc.

SLR tackles sparse linear regression problems, showing hardness for efficient algorithms.

Kronecker trend filtering improves lattice data smoothing.

Let $G$ be the group of complex points of a real semi-simple Lie group whose fundamental rank is equal to 1, e.g. $G= \SL_2 (\C) \times \SL_2 (\C)$ or $\SL_3 (\C)$. Then the fundamental rank of $G$ is $2,$ and according to the conjecture made in \cite{BV}, lattices in $G$ should have 'little' --- in the very weak sense…

We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algorithm that allows to detect objects of unknown shapes in the presence of random noise. The algorithm has linear complexity and exponential accuracy and …

Polynomial-time algorithm finds planted hypercube vectors in Gaussian mixtures.

Constructs minimal hypersurfaces in S^4(1) by doubling equatorial S^3.

We study the map degrees between quasitoric 4-manifolds. Our results rely on Theorems proved by Duan and Wang. We determine the set D (M, N) of all possible map degrees from M to N when M and N are certain quasitoric 4-manifolds. The obtained sets of integers are interesting, e. g. those representable as the sum of two…

The study counts Salem numbers linked to arithmetic hyperbolic orbifolds.

Study integrability of quantized six-vertex model on torus.

New property identifies arithmetic lattices from nonuniform lattices.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…

Course on arithmetic lattices at EPFL.

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lat…

Quantum phase diagrams for Chern topological insulators show jumps at critical loci.

New rigidity theorem for product of lattices.

We explore hybrid subgroups of certain non-arithmetic lattices in $\mathrm{PU}(2,1)$. We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in $\mathrm{PU}(1,1)$.

This paper studies the covolumes of nonuniform arithmetic lattices in PU(n, 1). We determine the smallest covolume nonuniform arithmetic lattices for each n, the number of minimal covolume lattices for each n, and study the growth of the minimal covolume as n varies. In particular, there is a unique lattice (up to conj…

The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.

Proves a lattice version of the Atiyah-Singer index theorem.

Sequence discriminative training criteria have long been a standard tool in automatic speech recognition for improving the performance of acoustic models over their maximum likelihood / cross entropy trained counterparts. While previously a lattice approximation of the search space has been necessary to reduce computat…

Vertex distortion measures how far lattice knots deviate from straight lines.

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More specifically, we show that for a large class of arithmetic lattices in SO(n,1) it …

We show that the set of even positive definite lattices that arise from smooth, simply-connected 4-manifolds bounded by a fixed homology 3-sphere can depend on more than the ranks of the lattices. We provide two homology 3-spheres with distinct sets of such lattices, each containing a distinct nonempty subset of the ra…

The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.

A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…

The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain t…