Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

15304459 · May 202619922001200920172026
48 results for reflective lattices

The paper classifies a specific type of hyperbolic lattices using geometric properties.

problem Classifying (1,2)(1{,}2)-reflective anisotropic hyperbolic lattices of rank 44.
method Using geometric properties of the fundamental polyhedron of a cocompact reflection group in three-dimensional Lobachevsky space.
result A classification of (1,2)(1{,}2)-reflective anisotropic hyperbolic lattices of rank 44.

A hyperbolic lattice is called \textit{1.21.2-reflective} if the subgroup of its automorphism group generated by all 11- and 22-reflections is of finite index. The main result of this article is a complete classification of 1.21.2-reflective maximal anisotropic lattices of rank 44.

2016-10-19abs ↗pdf ↗

The paper improves Vinberg's algorithm for arithmetic hyperbolic lattices.

problem Finding maximal reflection sublattices in arithmetic hyperbolic lattices.
method Provided an effective termination condition for Vinberg's semi-algorithm.
result The algorithm becomes an effective method for finding maximal reflection sublattices.

Picard modular groups are shown to be generated by complex reflections.

problem Understanding the structure of Picard modular groups using reflections.
method Using presentations from previous works to show generation by reflections.
result Picard modular groups mPU(2,1,Od){ m PU}(2,1,\mathcal{O}_d) are generated by complex reflections.

Study stabilizers of complex hyperbolic triangle groups, finding generators and signatures.

problem Understanding the stabilizers of complex hyperbolic triangle groups.
method Explicit generators and signatures of stabilizers computed for each group orbit of mirrors.
result Explicit generators and signatures of stabilizers for some triangle groups.

Constructs hyperbolic reflection groups with 3D limit sets.

problem Existence of convex cocompact groups with specific limit sets.
method Inputting a simplicial complex into a construction process yields a hyperbolic reflection group.
result Answers Kapovich's question affirmatively by creating a thin subgroup of an arithmetic lattice.

The paper defines parabolic subgroups for complex braid groups and proves they form a lattice.

problem Defining and characterizing parabolic subgroups in complex braid groups.
method Introducing and studying parabolic subgroups of generalized braid groups associated with complex reflection groups.
result Parabolic subgroups form a lattice in most cases, with specific properties and conjectures about hyperbolicity.

L-CNNs maintain gauge symmetry on non-Abelian lattice theories.

problem Applying convolutional neural networks to non-Abelian lattice gauge theories while preserving gauge symmetry.
method Developed a geometric formulation of L-CNNs that are equivariant under global symmetries and gauge transformations.
result Convolutional operations in L-CNNs are a specific case of gauge-equivariant neural networks on SU(NN) principal bundles.

Geometric constraints help classify hyperbolic polytopes.

problem Classifying reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
method Established geometric constraints on compact Coxeter polytopes in hyperbolic spaces.
result Geometric constraints are useful for classifying hyperbolic polytopes.

Ehrenborg and Jung recently related the order complex for the lattice of d-divisible partitions with the simplicial complex of pointed ordered set partitions via a homotopy equivalence. The latter has top homology naturally identified as a Specht module. Their work unifies that of Calderbank, Hanlon, Robinson, and Wach…

2011-08-06abs ↗pdf ↗

A hyperbolic 3-simplex reflection group is a Coxeter group arising as a lattice in the isometry group of hyperbolic 3-space, with fundamental domain a geodesic simplex (possibly with some ideal vertices). The classification of these groups is known, and there are exactly 9 cocompact examples, and 23 non-cocompact examp…

2007-05-07abs ↗pdf ↗

A Riemannian symmetric space is a Riemannian manifold in which it is possible to reflect all geodesics through a point by an isometry of the space. On such spaces, we introduce the notion of a distributional lattice, generalizing the notion of lattice. Distributional lattices exist in any Riemannian symmetric space: th…

2017-07-02abs ↗pdf ↗

For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in the faces. Furthermore, this Coxeter group is a lattice inside the isometry group …

2009-04-01abs ↗pdf ↗

Discrete knot theory models use lattice-filtered graphs to detect merging knot components.

problem Detecting merging knot components in discrete models.
method Lattice-filtered move graphs to model knot types, identifying connected components and merge scales.
result Merge scale defined by connected components of lattice-filtered move graphs, with specific examples for the figure-eight knot.

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

Translationally equivariant neural networks improve performance and generalization in physics problems.

problem Performance and generalization issues in machine learning applied to physics problems.
method Investigation of translationally equivariant convolutional neural networks for complex scalar field theory on a 2D lattice.
result Translationally equivariant neural networks significantly outperform non-equivariant architectures in various regression and classification tasks.

We introduce a new unsupervised representation learning and visualization using deep convolutional networks and self organizing maps called Deep Neural Maps (DNM). DNM jointly learns an embedding of the input data and a mapping from the embedding space to a two-dimensional lattice. We compare visualizations of DNM with…

2018-10-16abs ↗pdf ↗

The paper explores rigidity and proximality in dynamical systems, proving new results about CC^*-algebras.

problem Understanding rigidity and proximality in dynamical systems and their algebraic counterparts.
method Analyzing crossed products of dynamical systems and their CC^*-algebras, focusing on uniform rigidity and proximality.
result Uniformly rigid systems are almost reflecting, and certain crossed products are reflecting.

We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in the case of the Grover walk on lattices. Moreover, our numerical simulation sugge…

2015-07-05abs ↗pdf ↗

Hybrid subgroups found in non-arithmetic PU(2,1) lattices.

problem Exploring hybrid subgroups in non-arithmetic PU(2,1) lattices.
method Exploring hybrid subgroups of certain non-arithmetic lattices in PU(2,1). Showing that Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).
result Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).

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

problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.

This work compares lattice-free and lattice-based training criteria for LVCSR.

problem Improving acoustic model performance in speech recognition.
method Direct comparison of lattice-free and lattice-based sequence discriminative training criteria using GPU.
result Lattice-free MMI performance is comparable to lattice-based criteria, while lattice-based sMBR remains superior.

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…

2011-11-21abs ↗pdf ↗

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

2018-03-09abs ↗pdf ↗

Efficiently estimates material parameter space with multifidelity Gaussian process modeling.

problem Estimating a region of material parameter space with similar precipitate shapes.
method Multifidelity Gaussian process modeling to reduce computational cost.
result Significant reduction in sampling cost for accurate LER estimation.

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…

2011-07-26abs ↗pdf ↗

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

problem Locally finite 2-complexes and their automorphism groups contain incommensurable lattices.
method Constructing lattices in combinatorial models of Baumslag-Solitar groups and analyzing their properties.
result The constructed lattices are incommensurable and have specific properties like isomorphic Cayley graphs.

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

problem Index problems of Wilson-Dirac operators on lattice approximations of manifolds.
method Formulates and proves a KK-theoretic formula for an index-type invariant.
result Main theorem gives a formula for an index-type invariant of operators on lattice approximations of closed integral affine manifolds.

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 …

2018-09-07abs ↗pdf ↗

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…

2018-08-30abs ↗pdf ↗

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

problem Residual finiteness of lattices in PU(2,1)~\widetilde{\mathrm{PU}(2,1)} and existence of smooth projective surfaces.
method Proved residual finiteness of certain lattices and constructed surfaces using central extensions.
result First examples of residually finite lattices in PU(2,1)~\widetilde{\mathrm{PU}(2,1)} and construction of surfaces with specific fundamental groups.

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…

2012-05-23abs ↗pdf ↗

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

problem Investigating transformations and deformations of lattice diagrams and their associated dotted diagrams.
method Introducing dotted diagrams and investigating deformations of these diagrams, relating them to transformations of lattice diagrams.
result Refined results on the relation between deformations of admissible dotted diagrams and transformations of lattice diagrams.

Classifies knots by lattice size, finding unknot ratios and crossing numbers.

problem Understanding the distribution of knots within different lattice sizes.
method Introduced a new knot classification by lattice size, analyzed ratios of unknots and knots with more than 10 crossings, and compared with theoretical estimates.
result Ratio of unknots decreases exponentially with lattice size, and computational results match theoretical estimates.

Let GG be a simply connected, solvable Lie group and ΓΓ a lattice in GG. The deformation space D(Γ,G)\mathcal{D}(Γ,G) is the orbit space associated to the action of $\Aut(G)$ on the space X(Γ,G)\mathcal{X}(Γ,G) of all lattice embeddings of ΓΓ into GG. Our main result generalises the classical rigidity theorems of Mal'tsev…

2011-11-23abs ↗pdf ↗