English
Related papers

Related papers: Weakly Divisible Rings

200 papers

The present paper introduces and studies some new types of rings and ideals such as completely nilary rings ( resp. completely nilary ideals ), weakly nilary ideals. Some properties of each are obtained and some characterizations of each…

Rings and Algebras · Mathematics 2022-08-19 Omar A. Al-Mallah , Hafed M. Al-Nogashi- Nooman Jarboui

Bhargava parametrized quintic rings over $\mathbb{Z}$ by quadruples of $5\times 5$ alternating matrices. We extend the construction to work similarly over any Dedekind domain $R$. No assumptions are needed on the characteristic of $R$. The…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

We consider the degrees of the elements of a homogeneous system of parameters for the ring of invariants of a binary form, give a divisibility condition, and a complete classification for forms of degree at most 8.

Commutative Algebra · Mathematics 2017-10-10 Andries E. Brouwer , Jan Draisma , Mihaela Popoviciu

We consider the problem of finding a cycle in a sparse directed graph $G$ that is promised to be far from acyclic, meaning that the smallest feedback arc set in $G$ is large. We prove an information-theoretic lower bound, showing that for…

Data Structures and Algorithms · Computer Science 2019-07-30 Xi Chen , Tim Randolph , Rocco A. Servedio , Timothy Sun

Let $n>1$ be a positive integer. Let $R$ be a henselian local ring with residue field $k$ of $n$th level $s_n(k)$. We give some upper and lower bounds for the $n$th Waring number $w_n(R)$ in terms of $w_n(k)$ and $s_n(k)$. In large number…

Commutative Algebra · Mathematics 2024-08-26 Tomasz Kowalczyk , Piotr Miska

Weight enumerators are important tools for deciphering the algebraic structure of the related code spaces and for understanding group actions on these spaces. Our study focuses on symmetrized weight enumerators of pairs of Type II codes…

Combinatorics · Mathematics 2025-12-05 A. K. M. Selim Reza , Manabu Oura , Nur Hamid

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

Discrete Mathematics · Computer Science 2026-03-03 Eitatsu Tomita , Tomohiro I

We improve a result of H. L. Montgomery and J. P. Weinberger by establishing the existence of infinitely many fundamental discriminants $d>0$ for which the class number of the real quadratic field $\mathbb{Q}(\sqrt{d})$ exeeds…

Number Theory · Mathematics 2015-02-09 Youness Lamzouri

We show that an order in a quartic field has fewer than $3000$ essentially different generators as a $\mathbb Z$-algebra (and fewer than $200$ if the discriminant of the order is sufficiently large). This significantly improves the…

Number Theory · Mathematics 2022-10-05 Manjul Bhargava

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…

Combinatorics · Mathematics 2022-04-05 Romain Ageron , Paul Casteras , Thibaut Pellerin , Yann Portella , Arpad Rimmel , Joanna Tomasik

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

Number Theory · Mathematics 2022-01-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We determine the minimal number of separating invariants for the invariant ring of a matrix group $G < \mathrm{GL}_n(\mathbb{F}_q)$ over the finite field $\mathbb{F}_q$. We show that this minimal number can be obtained with invariants of…

Representation Theory · Mathematics 2021-11-16 Gregor Kemper , Artem Lopatin , Fabian Reimers

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Computational Complexity · Computer Science 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

We review the definition of D-rings introduced by H. Gunji & D. L. MacQuillan. We provide an alternative characterization for such rings that allows us to give an elementary proof of that a ring of algebraic integers is a D-ring. Moreover,…

Commutative Algebra · Mathematics 2010-10-29 Luis F. Caceres , Jose A Velez Marulanda

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

Number Theory · Mathematics 2019-08-30 Jean-Marc Couveignes

We introduce the class weakly nil clean rings, as rings R in which for every a\in R there exist an idempotent e and a nilpotent q such that a-e-q\in eRa. Every weakly nil clean ring is exchange. Weakly nil clean rings contain pi-regular…

Rings and Algebras · Mathematics 2015-06-23 Peter Danchev , Janez Šter

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Representation Theory · Mathematics 2021-07-15 Harm Derksen , Visu Makam

We consider the "limiting behavior" of *discriminants*, by which we mean informally the locus in some parameter space of some type of object where the objects have certain singularities. We focus on the space of partially labeled points on…

Algebraic Geometry · Mathematics 2015-11-03 Ravi Vakil , Melanie Matchett Wood

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

A group is called strongly bounded, if the speed with which it is generated by finitely many conjugacy classes has a positive, lower bound only dependent on the number of the conjugacy classes in question rather than the actual conjugacy…

Group Theory · Mathematics 2021-07-20 Alexander Alois Trost