English
Related papers

Related papers: On the Maximum Flatness Factor over Unimodular Lat…

200 papers

We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…

Numerical Analysis · Mathematics 2019-08-15 Josef Dick , Friedrich Pillichshammer , Kosuke Suzuki , Mario Ullrich , Takehito Yoshiki

We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…

Information Theory · Computer Science 2016-11-17 Camilla Hollanti , Jyrki Lahtonen , Hsiao-feng Francis Lu

We utilize Polyakov loop correlations to study d=3+1 compact U (1) flux tubes and the static electron-positron potential in lattice gauge theory. With the plaquette field operator, in U(1) lattice gauge theory, we probe directly the…

High Energy Physics - Lattice · Physics 2013-09-17 A. Amado , N. Cardoso , P. Bicudo

This thesis describes the development of the density matrix embedding theory (DMET) and its applications to lattice strongly correlated electron problems, including a review of DMET theory and algorithms (Ch 2), investigation of finite size…

Strongly Correlated Electrons · Physics 2018-03-29 Bo-Xiao Zheng

In this paper, we derive a Singleton bound for lattice schemes and obtain Singleton bounds known for binary codes and subspace codes as special cases. It is shown that the modular structure affects the strength of the Singleton bound. We…

Information Theory · Computer Science 2015-06-17 Srikanth B. Pai , B. Sundar Rajan

We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight t^m to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s…

Statistical Mechanics · Physics 2009-11-10 R. Rajesh , Deepak Dhar

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

Number Theory · Mathematics 2022-04-14 Mohamed Taoufiq Damir , Guillermo Mantilla-Soler

This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…

Combinatorics · Mathematics 2025-04-09 Dale R. Worley

A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…

Combinatorics · Mathematics 2024-04-08 Atsushi Matsuo , Hiroki Shimakura

In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…

Rings and Algebras · Mathematics 2018-12-10 Claudia Muresan

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…

Data Structures and Algorithms · Computer Science 2014-11-14 Jincheng Mei , Kang Zhao , Bao-Liang Lu

Let $L =\sqrt{\frac{1}{\Im(z)}}\Big({\mathbb Z}\oplus z{\mathbb Z}\Big)$ where $z \in \mathbb{H}=\{z= x+ i y\;\hbox{or}\;(x,y)\in\mathbb{C}: y>0\}$ be the two dimensional lattices with unit density. Assuming that $\alpha\geq1$, we prove…

Analysis of PDEs · Mathematics 2023-02-13 Senping Luo , Juncheng Wei

This paper develops a generalized cotangent-type series, extending classical expansions to higher-order lattice sums. By introducing a new family of series indexed by integer powers, we derive closed form representations that combine…

Number Theory · Mathematics 2025-11-04 Mahipal Gurram

Kang et al. provided a path realization of the crystal graph of a highest weight module over a quantum affine algebra, as certain semi-infinite tensor products of a single perfect crystal. In this paper, this result is generalized to give a…

Quantum Algebra · Mathematics 2007-05-23 Masato Okado , Anne Schilling , Mark Shimozono

We analytically consider the spontaneous formation of a fermionic crystalline geometry in a gravity background with Lifshitz scaling and/or hyperscaling violation. Fermionic vortex lattice solution sourced by the lowest Laundau level has…

High Energy Physics - Theory · Physics 2016-08-24 Li-Ke Chen , Hong Guo , Fu-Wen Shu

The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…

Number Theory · Mathematics 2025-11-18 Koen de Boer , Aurel Page , Radu Toma , Benjamin Wesolowski

It was shown in previous work that the one-variable $\widehat\mu$-function defined by Zwegers (and Zagier) and his indefinite theta series attached to lattices of signature $(r\!+\!1,1)$ are both Heisenberg harmonic Maa\ss-Jacobi forms. We…

Number Theory · Mathematics 2015-05-21 Martin Westerholt-Raum

The structure function of the vortex lattice of layered superconductor is calculated to one-loop order. Based on a phenomenological melting criterion concerning the Debye-Waller factor, we calculate the melting line of the vortex lattice,…

Superconductivity · Physics 2007-07-04 Bo Feng , Zhigang Wu , Dingping Li

We prove that a type II$_1$ factor $M$ can have at most one Cartan subalgebra $A$ satisfying a combination of rigidity and compact approximation properties. We use this result to show that within the class $\Cal H \Cal T$ of factors $M$…

Operator Algebras · Mathematics 2007-05-23 Sorin Popa

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we study the similarity classes of well-rounded sublattices of ${\mathbb Z}^2$. We relate the set of all such similarity classes…

Number Theory · Mathematics 2009-08-25 Lenny Fukshansky