相关论文: Generalized Theta Series of a Lattice
The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…
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…
Given an integral lattice $\Lambda$ of rank $n$ and a finite sequence $m_1 \leq m_2 \leq ... \leq m_k$ of natural numbers we construct a modular form $\Theta_{m_1,m_2,...,m_k,\Lambda}$ of level $N=N(\Lambda)$. The weight of this modular…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
Theta series for lattices with indefinite signature $(n_+,n_-)$ arise in many areas of mathematics including representation theory and enumerative algebraic geometry. Their modular properties are well understood in the Lorentzian case…
We introduce a new arithmetic invariant for hermitian line bundles on an arithmetic variety. We use this invariant to measure the variation of the volume function with respect to the metric. The main result of this paper is a generalized…
We present a unified framework to describe lattice gauge theories by means of tensor networks: this framework is efficient as it exploits the high amount of local symmetry content native of these systems describing only the gauge invariant…
We derive lattice invariants from the heat flux of a lattice. Using systems of harmonic polynomials, we obtain sums of products of spherical theta functions which give new invariants of integer lattices which are modular forms. In…
Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code design in various wireless communication setups. However,…
In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Direct links between generalized harmonic numbers, linear Euler sums and Tornheim double series are established in a more perspicuous manner than is found in existing literature. We show that every linear Euler sum can be decomposed into a…
Lattice gauge theory's discretization of spacetime suffers from a drawback in that Lorentz covariance is lost because the axes of the lattice create preferred directions in spacetime. Smaller and smaller lattice spacings decrease the effect…
We find two combinatorial identities on the theta series of the root lattices of the finite-dimensional simple Lie algebras of type $D_{4n}$ and the cosets in their integral duals, in terms of the well-known Essenstein series $E_4(z)$ and…
A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…
We construct a generalization of pure lattice gauge theory (LGT) where the role of the gauge group is played by a tensor category. The type of tensor category admissible (spherical, ribbon, symmetric) depends on the dimension of the…
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
Let $(x_{i}, y_{i})_{i=1,\dots,n}$ denote independent samples from a general mixture distribution $\sum_{c\in\mathcal{C}}\rho_{c}P_{c}^{x}$, and consider the hypothesis class of generalized linear models $\hat{y} = F(\Theta^{\top}x)$. In…
These are expanded notes on a lecture of the same title at the 2015 AMS summer institute in algebraic geometry. We give an introduction and overview of the "beyond geometric invariant theory" program for analyzing moduli problems in…