Related papers: On Locally GCD Equivalent Number Fields

Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…

We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a…

Two fields are Witt equivalent if their Witt rings of symmetric bilinear forms are isomorphic. Witt equivalent fields can be understood to be fields having the same quadratic form theory. The behavior of finite fields, local fields, global…

We prove that infinite Galois extensions of number fields with Galois group of finite exponent have the Northcott property. The main novelty of our approach lies in the application of a theorem of Segal on profinite groups.

Let $G$ be a finite group and $K$ a number field. We construct a $G$-extension $E/F$, with $F$ of transcendence degree $2$ over $K$, that specializes to all $G$-extensions of $K_\mathfrak{p}$, where $\mathfrak{p}$ runs over all but finitely…

Current methods for the classification of number fields with small regulator depend mainly on an upper bound for the discriminant, which can be improved by looking for the best possible upper bound of a specific polynomial function over an…

Let $q$ be a quadratic form over a field $F$ and let $L$ be a field extension of $F$ of odd degree. It is a classical result that if $q_L$ is isotropic (resp. hyperbolic) then $q$ is isotropic (resp. hyperbolic). In turn, given two…

An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…

A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a…

In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. Recently, Blake and Lin computed the number of shortest…

We investigate how often geodesics have homology in a fixed set of the homology lattice of a compact Riemann surface. We prove that closed geodesics are equidistributed on any sets with asymptotic density with respect to a specific norm. We…

This paper introduces a natural extension of Kolchin's differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-linear case the iterative Picard-Vessiot theory recently developed by Matzat…

Gibbs random fields corresponding to systems of real-valued spins (e.g. systems of interacting anharmonic oscillators) indexed by the vertices of unbounded degree graphs with a certain summability property are constructed. It is proven that…

When do two irreducible polynomials with integer coefficients define the same number field? One can define an action of $\mathrm{GL}_2 \times \mathrm{GL}_1$ on the space of polynomials of degree $n$ so that for any two polynomials $f$ and…

The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…

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…