Related papers: On Locally GCD Equivalent Number Fields

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…

We extend the Brauer-Siegel theorem to new families of number fields, both in the classical setting of asymptotically bad families and in the more general framework due to Tsfasman and Vl\u{a}du\c{t} of asymptotically exact families. We…

Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…

An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…

We show that the local weak limit of a sequence of finite expander graphs with uniformly bounded degree is an ergodic (or extremal) unimodular random graph. In particular, the critical probability of percolation of the limiting random graph…

Given a $p$-adic field $K$ and a prime number $\ell$, we count the total number of the isomorphism classes of $p^\ell$-extensions of $K$ having no intermediate fields. Moreover for each group that can appear as Galois group of the normal…

We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v with distinct closed neighborhood, the sets of colors that…

We describe a new approach to derive numerical approximations of boundary conditions for high-order accurate finite-difference approximations. The approach, called the Local Compatibility Boundary Condition (LCBC) method, uses boundary…

Let $k$ be a number field. We provide an asymptotic formula for the number of Galois extensions of $k$ with absolute discriminant bounded by some $X \geq 1$, as $X\to\infty$. We also provide an asymptotic formula for the closely related…

An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…

In this paper, assuming the weak Schanuel Conjecture (WSC), we prove that for any collection of pairwise non-arithmetically equivalent totally real number fields, the residues at $s=1$ of their Dedekind zeta functions form a linearly…

Let F be a non-Archimedean local field of residual characteristic p, and {\ell} be a prime number different from p. We consider the local Jacquet-Langlands correspondence between {\ell}-adic discrete series of GL(n,F) and an inner form…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…

In this paper we investigate the distribution of the number of primes which ramify in number fields of degree d <= 5. In analogy with the classical Erdos-Kac theorem, we prove for S_d-extensions that the number of such primes is normally…

All current techniques for showing that a number field has an infinite p-class field tower depend on one of various forms of the Golod-Shafarevich inequality. Such techniques can also be used to restrict the types of p-groups which can…

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

Let $p$ be a prime and let $\mathbb{Q}_p$ be the field of $p$-adic numbers. It is known that the finite extensions of $\mathbb{Q}_p$ of a given degree are finite up to isomorphism. Given a cubic field extension $L$ of $\mathbb{Q}_p$…

Let $\mathcal{G}$ be a locally compact \'{e}tale groupoid and $\mathscr{L}(L^2(\mathcal{G}))$ be the $C^*$-algebra of adjointable operators on the Hilbert $C^*$-module $L^2(\mathcal{G})$. In this paper, we discover a notion called…