English
Related papers

Related papers: Transcendence degrees over mutually generic extens…

200 papers

Let A be a complete discrete valuation ring with possibly imperfect residue field. The purpose of this paper is to give a notion of conductor for Galois representations over A that generalizes the classical Artin conductor. The definition…

Number Theory · Mathematics 2007-05-23 James M. Borger

We prove the finiteness of the genus of finite-dimensional division algebras over many infinitely generated fields. More precisely, let $K$ be a finite field extension of a field which is a purely transcendental extension of infinite…

Rings and Algebras · Mathematics 2024-10-01 Sergey V. Tikhonov

We estimate the Castelnuovo-Mumford regularity of ideals in a polynomial ring over a field by studying the regularity of certain modules generated in degree zero and with linear relations. In dimension one, this process gives a new type of…

Commutative Algebra · Mathematics 2021-04-28 Giulio Caviglia , Alessandro De Stefani

It is known that sometimes a Belyi pair is not defined over its field of moduli. Instead, it is defined over a finite degree extension of its field of moduli, called a field of definition. We show that given a number $m$ there exists a…

Algebraic Geometry · Mathematics 2023-04-21 Alexander Molyakov

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

Commutative Algebra · Mathematics 2021-01-19 Doan Trung Cuong , Sijong Kwak

In this paper, we introduce the commutativity degree of a finite-dimensional Lie algebra over a finite field and determine upper and lower bounds for it. Moreover, we study some relations between the notion of commutativity degree and known…

Algebraic Geometry · Mathematics 2024-06-17 Afsaneh Shamsaki , Ahmad Erfanian , Mohsen Parvizi

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…

Combinatorics · Mathematics 2019-02-20 Wenying Gan , Po-Shen Loh , Benny Sudakov

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

Number Theory · Mathematics 2023-08-25 Victor Fadinger , Sophie Frisch , Daniel Windisch

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…

Number Theory · Mathematics 2021-12-30 Joachim König , Danny Neftin

We prove that if $\mathbb{F}$ is an algebraically closed field of zero characteristic which has infinite transcendence degree over $\mathbb{Q}$, then there exists a field automorphism $\varphi$ of ${\rm SL}_n(\mathbb{F})$ and ${\rm…

Group Theory · Mathematics 2017-10-12 Timur Nasybullov

The ring R of real-exponent polynomials in n variables over any field has global dimension n+1 and flat dimension n. In particular, the residue field k = R/m of R modulo its maximal graded ideal m has flat dimension n via a Koszul-like…

Commutative Algebra · Mathematics 2023-09-20 Nathan Geist , Ezra Miller

We show that degrees containing a complete extensions of arithmetic have the random join property: they are the supremum of any random real they compute, with another random real. The same is true for the truth-table and weak truth-table…

Logic · Mathematics 2022-11-17 George Barmpalias , Wei Wang

We study the essential dimension of a finite group G over a field K. A generalization of the central extension theorem of Buhler and Reichstein (Compositio Math. 106 (1997) 159-179, Theorem 5.3) is obtained. We also get lower bounds of…

Algebraic Geometry · Mathematics 2007-05-23 Ming-chang Kang

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

Combinatorics · Mathematics 2025-12-10 Csilla Bujtás , Sandi Klavžar , Jing Tian

Let $K$ be a field, $\mathcal {O}_v$ a valuation ring of $K$ associated to a valuation $v$: $K\rightarrow\Gamma\cup\{\infty\}$, and ${\bf m}_v$ the unique maximal ideal of $\mathcal {O}_v$. Consider an ideal $\mathcal {I}$ of the free…

Rings and Algebras · Mathematics 2010-11-15 Huishi Li

We determine the finite groups whose real irreducible representations have different degrees.

Group Theory · Mathematics 2025-05-08 Thomas Breuer , Frank Calegari , Silvio Dolfi , Gabriel Navarro , Pham Huu Tiep

An axis-parallel $d$--dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_d$ where $R_i$ (for $1 \le i \le d$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its \emph{boxicity}…

Combinatorics · Mathematics 2007-05-23 L. Sunil Chandran , Mathew C. Francis , Naveen Sivadasan

We investigate the Voronoi summation problem for ${\rm GL}_n$ in the level aspect for $n\geq 2$. Of particular interest are those primes at which the level and modulus are jointly ramified - a common occurrence in analytic number theory…

Number Theory · Mathematics 2018-07-03 Andrew Corbett

We show that every graph $G$ of maximum degree $\Delta$ and sufficiently large order has a vertex cutset $S$ of order at most $\Delta$ that induces a subgraph $G[S]$ of maximum degree at most $\Delta-3$. For $\Delta\in \{ 4,5\}$, we refine…

Combinatorics · Mathematics 2023-04-21 Stéphane Bessy , Johannes Rauch , Dieter Rautenbach , Uéverton S. Souza

We prove that the maximum degree $\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\Delta_n/\log n \to c$ in probability, and $\mathbb{E}\, \Delta_n \sim c \log n$ for a computable constant $c>0$. The same result…

Combinatorics · Mathematics 2010-09-01 Michael Drmota , Omer Gimenez , Marc Noy