Related papers: On the Dimension of AG Trace Codes
In this paper, we determine explicit bases for Riemann--Roch spaces of linearized function fields, and we give a lower bound for the minimum distance of generalized algebraic geometry codes. As a consequence, we construct generalized…
The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance…
We generalize the known constructions of A-hypergeometric functions. In particular, we show that periods of middle dimension on affine or projective complex algebraic varieties are A-hypergeometric functions of coefficients of polynomial…
We prove some basic results on the dimension theory of algebraic stacks, and on the multiplicities of their irreducible components, for which we do not know a reference.
Assuming the completeness condition for boundaries we derive trace formulas for the annulus coefficients in 2-dimensional conformal field theory. We also derive polynomial equations that relate the annulus, Moebius and Klein bottle…
We investigate trace formulas in $\varepsilon$-deformed W-algebras, highlighting a novel connection to the modular double of $\mathfrak{q}$-deformed W-algebras. In particular, we show that torus correlators in the additive (Yangian) setting…
We survey recent developments on generalizing the Gross--Zagier formula to high dimensional Shimura varieties, with an emphasis on the Arithmetic Gan--Gross--Prasad conjecture and the relative trace formula approach.
We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…
Many features of dimensional reduction schemes are determined by the breaking of higher dimensional general covariance associated with the selection of a particular subset of coordinates. By investigating residual covariance we introduce…
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…
We improve on the lower bound of the maximum number of planes in $\operatorname{PG}(8,q)\cong\F_q^{9}$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)\ge q^{12}+…
We study geometric properties of trace functionals that generalize those in [Zhang, Adv. Math. 365:107053 (2020)], arising from a novel family of conditional entropies with applications in quantum information. Building on new convexity…
The p-adic formulation of replica symmetry breaking is presented. In this approach ultrametricity is a natural consequence of the basic properties of the p-adic numbers. Many properties can be simply derived in this approach and p-adic…
Let $\mathcal{L}$ and $\mathcal{L}_0$ be the binary codes generated by the column $\mathbb{F}_2$-null space of the incidence matrix of external points versus passant lines and internal points versus secant lines with respect to a conic in…
We are going to introduce a new algebraic, analytic structure that is a kind of generalization of the Hausdorff dimension and measure. We give many examples and study the basic properties and relations of such systems.
In this contribution we present the results of a series of investigations of dimensional reduction, applied to SU(3) gauge theory in 2 + 1 dimensions. We review earlier results, present a new reduced model with Z(3) symmetry, and discuss…
Based on ideas of K\"otter and Kschischang we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in Braun, Kerber and Laue as a…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of $\F_q^n$ with a given dimension. A computer search for large constant…
One of the most fundamental topics in subspace coding is to explore the maximal possible value ${\bf A}_q(n,d,k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$ such that the subspace distance satisfies $\operatorname{d_S}(U,V) =…