Related papers: On Locally GCD Equivalent Number Fields
In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…
Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…
Classical affine Lie algebras appear e.g. as symmetries of infinite dimensional integrable systems and are related to certain differential equations. They are central extensions of current algebras associated to finite-dimensional Lie…
Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are obtained for a class of \'etale groupoids that we call inner…
We prove inequalities that compare the relative regulator of an extension of number fields with a product of heights of multiplicatively independent relative units.
In [7], results about the global Jacquet-Langlands correspondence, (weak and strong) multiplicity-one theorems and the classification of automorphic representations for inner forms of the general linear group over a number field are…
Given a number field $L$, we define the degree of an algebraic number $v \in L$ with respect to a choice of a primitive element of $L$. We propose the question of computing the minimal degrees of algebraic numbers in $L$, and examine these…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
Let $G$ be a simple connected graph with order $ n(G)$, local metric dimension $ {\rm dim}_l(G)$, local adjacency metric dimension $ {\rm dim}_{A,l}(G)$, and clique number $ \omega(G)$, where $G\not\cong K_{n(G)}$ and $\omega(G)\geq3$. It…
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result…
Given a field K, one may ask which finite groups are Galois groups of field extensions L/K such that L is a maximal subfield of a division algebra with center K. This connection between inverse Galois theory and division algebras was first…
As a part of our program for Geometric Arithmetic, we develop an arithmetic cohomology theory for number fields using theory of locally compact groups.
Given a number field $K$ one associates to it the set $\Lambda_K$ of Dedekind zeta-functions of finite abelian extensions of $K$. In this short note we present a proof of the following Theorem: for any number field $K$ the set $\Lambda_K$…
We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…
The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error…
Let $G = GL(V)$ for an N-dimensional vector space $V$ over an algebraically closed field k, and $G^{\theta}$ the fixed point subgroup of $G$ under an involution $\theta$ on $G$. In the case where $G^{\theta} = O(V)$, the generalized…
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been…
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a $(2,3)$-regular compact graph. In this paper, we introduce a family of $(d_v,d_c)$-regular GLDPC codes with convolutional code…