English
Related papers

Related papers: Multiply monogenic orders

200 papers

We examine the Pythagoras number $\mathcal{P}(\mathcal{O}_K)$ of the ring of integers $\mathcal{O}_K$ in a totally real biquadratic number field $K$. We show that the known upper bound $7$ is attained in a large and natural infinite family…

Number Theory · Mathematics 2022-12-08 Jakub Krásenský , Martin Raška , Ester Sgallová

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Commutative Algebra · Mathematics 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

Let $f(x) = (x^{2}+1)^{n} - a x^{n} \in \mathbb{Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta$ be a root of $f(x)$, set $K= \mathbb{Q}(\theta)$, and denote by $\mathbb{Z}_{K}$ the ring of integers of $K$. The index of $f$, denoted…

Number Theory · Mathematics 2026-02-18 Rupam Barman , Anuj Narode , Vinay Wagh

Let $K=\Q(\theta)$ be an algebraic number field with $\theta$ a root of an irreducible quadrinomial $f(x) = x^6+ax^m+bx+c\in\Z[x] $ with $m\in\{2,3,4,5\}$. In the present paper, we give some explicit conditions involving only $a,~b,~c$ and…

Number Theory · Mathematics 2023-03-02 Anuj Jakhar , Ravi Kalwaniya

Let G be a group. Two elements x and y in G are said to be in the same z-class if their centralizers in G are conjugate within G. In this paper, we prove that the number of z-classes in the group of upper triangular matrices is infinite…

Group Theory · Mathematics 2019-01-24 Sushil Bhunia

Let $K$ be a number field and $f_1,\ldots,f_s\in K[x_1,\ldots,x_n]$ forms of odd degrees. In 1957, Birch proved that if $n$ is sufficiently large then the forms always have a nontrivial zero in $K^n$. Apart from some small degrees, the…

Number Theory · Mathematics 2025-12-02 Amichai Lampert , Andrew Snowden , Tamar Ziegler

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

Commutative Algebra · Mathematics 2026-02-27 Martin Kreuzer , Lorenzo Robbiano

Let $f(x) \in K(x)$ be a quadratic polynomial where $K$ is a field of characteristic not equal to $2$. The associated arboreal Galois representation of the absolute Galois group of $K$ acts on a regular rooted binary tree. Boston and Jones…

Number Theory · Mathematics 2026-04-07 Özlem Ejder , Dilber Kocak

Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is…

Rings and Algebras · Mathematics 2023-09-26 Huihui Zhu , Liyun Wu

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

Rings and Algebras · Mathematics 2016-11-25 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

Logic · Mathematics 2020-06-02 Eliahu Levy

We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…

Number Theory · Mathematics 2018-09-10 James Borger , Bart de Smit

Let $m$ be an integer, $m\neq -8,-3,0,5$ such that $m^2+3m+9$ is square free. Let $\alpha$ be a root of \[ f=x^6-2mx^5-(5m+15)x^4-20x^3+5mx^2+(2m+6)x+1. \] The totally real cyclic fields $K=Q(\alpha)$ are called simplest sextic fields and…

Number Theory · Mathematics 2018-09-27 István Gaál , László Remete

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

Number Theory · Mathematics 2019-10-08 Alain Lasjaunias

Let $W$ be an $n$-dimensional vector space over a finite field $\mathbb{F}_q$ of any characteristic and $mW$ denote the direct sum of $m$ copies of $W$. Let $\mathbb{F}_q[mW]^{{\rm GL}(W)}$ and $\mathbb{F}_q(mW)^{{\rm GL}(W)}$ denote the…

Commutative Algebra · Mathematics 2020-03-02 Yin Chen , Zhongming Tang

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Combinatorics · Mathematics 2015-05-20 Sean R. Carrell , Guillaume Chapuy

Let W_n(K) be the Lie algebra of derivations of the polynomial algebra K[X]:=K[x_1,...,x_n] over an algebraically closed field K of characteristic zero. A subalgebra L of W_n(K) is called polynomial if it is a submodule of the K[X]-module…

Rings and Algebras · Mathematics 2012-01-04 I. V. Arzhantsev , E. A. Makedonskii , A. P. Petravchuk

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…

Computational Complexity · Computer Science 2021-07-02 Radu Curticapean , Holger Dell , Thore Husfeldt