Related papers: On Locally GCD Equivalent Number Fields

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

We study the differential Galois theory of difference equations under weaker hypothesis on the field of constants of the automorphism. This framework yields a new approach to results by C.Hardouin and M.Singer, which answers possitively a…

We study the local isomorphism classes, also known as genera or weak equivalence classes, of fractional ideals of orders in \'etale algebras. We provide a classification in terms of linear algebra objects over residue fields. As a…

Graph Edit Distance (GED) is a fundamental, albeit NP-hard, metric for structural graph similarity. Recent neural graph matching architectures approximate GED by first encoding graphs with a Graph Neural Network (GNN) and then applying…

Suppose that $p$ is an odd prime and $g>1$ is a primitive root modulo $p$. Let $M$ be a number field contained in the $p$-th cyclotomic field. Girstmair found a surprising relation between the relative class number of $M$ and the digits of…

For various nonsolvable groups $G$, we prove the existence of extensions of the rationals $\mathbb{Q}$ with Galois group $G$ and inertia groups of order dividing $ge(G)$, where $ge(G)$ is the smallest exponent of a generating set for $G$.…

In this article, we prove a Reocurrence Theorem over function fields of curves over $\mathbf{C}(\! (t)\! )$ and over finite extensions of the Laurent series field $\mathbf{C}(\! (x,y)\! )$. This provides a partial replacement to…

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

Logarithmic conformal field theories are based on vertex algebras with non-semisimple representation categories. While examples of such theories have been known for more than 25 years, some crucial aspects of local logarithmic CFTs have…

Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

We determine and explicitly parametrize the isomorphism classes of nonassociative quaternion algebras over a field of characteristic different from two, as well as the isomorphism classes of nonassociative cyclic algebras of odd prime…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

In the present paper, we provide a new analogy between number fields and 1-dimensional function fields over finite fields from the viewpoint that the maximal cyclotomic extension of a number field is analogous to the constant field…

Let $\ell$ be a prime number different from the residue characteristic of a non-archimedean local field $F$. We give formulations of $\ell$-adic local Langlands correspondences for connected reductive algebraic groups over $F$, which we…

The isotropy of multiples of Pfister forms is studied. In particular, an improved lower bound on the value of their first Witt index is obtained. This result and certain of its corollaries are applied to the study of the weak isotropy index…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

This paper is the next installment of our analysis of length-commensurable locally symmetric spaces begun in Publ. math. IHES 109(2009), 113-184. For a Riemannian manifold $M$, we let $L(M)$ be the weak length spectrum of $M$, i.e. the set…

In 1999, Xing, Niederreiter and Lam introduced a generalization of AG codes using the evaluation at non-rational places of a function field. In this paper, we show that one can obtain a locality parameter $r$ in such codes by using only…