Related papers: Weakly Divisible Rings

A positive integer $n$ is said to be $k$-layered if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we start the systematic study of these class of numbers. In particular, we state some algorithms to find some…

The repetition threshold for words on $n$ letters, denoted $\mbox{RT}(n)$, is the infimum of the set of all $r$ such that there are arbitrarily long $r$-free words over $n$ letters. A repetition threshold for circular words on $n$ letters…

We significantly strengthen results on the structure of matrix rings over finite fields and apply them to describe the structure of the so-called weakly $n$-torsion clean rings. Specifically, we establish that, for any field $F$ with either…

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

Under ABC, Silverman showed that there are infinitely many non-Wieferich primes with respect to any (non-trivial) base $a$. Recently Srinivas and Subramani proved an analogous result over number fields with trivial class group. In the first…

We investigate the problem of determining a set S of k indistinguishable integers in the range [1,n]. The algorithm is allowed to query an integer $q\in [1,n]$, and receive a response comparing this integer to an integer randomly chosen…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are…

This paper introduces and studies nil-reversible rings wherein we call a ring R nil-reversible if the left and right annihilators of every nilpotent element of R are equal. Reversible rings (and hence reduced rings) form a proper subclass…

We prove that, for any $\varepsilon>0$, the number of real quadratic fields $\mathbb{Q}(\sqrt{d})$ of discriminant $d<x$ whose class number is $\ll \sqrt{d}(\log{d})^{-2}(\log\log{d})^{-1}$ is at least $x^{1/2-\varepsilon}$ for $x$ large…

Let $D>1$ be an integer, and let $b=b(D)>1$ be its smallest divisor. We show that there are infinitely many number fields of degree $D$ whose primitive elements all have relatively large height in terms of $b$, $D$ and the discriminant of…

In this note we provide important and significant observations in ring theory related to weakly tripotent rings. We provide counterexamples for the structure theorem for commutative weakly tripotent rings appeared in arXiv (2017) and Bull.…

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

In 1992, Erd$\H{o}$s and Hegyv$\'{a}$ri showed that for any prime p, there exist infinitely many length 3 weakly prime-additive numbers divisible by p. In 2018, Fang and Chen showed that for any positive integer m, there exists infinitely…

We introduce a concept of rings of right (left) almost stable range $1$ and we construct a theory of a canonical diagonal reduction of matrices over such rings. A description of new classes of noncommutative elementary divisor rings is done…

Let S = <s_1, s_2, s_3, ..., s_n> be a given vector of n real numbers. The rank of a real z with respect to S is defined as the number of elements s_i in S such that s_i is less than or equal to z. We consider the following decision…

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

The element distinctness problem takes as input a list $I$ of $n$ values from a totally ordered universe and the goal is to decide whether $I$ contains any duplicates. It is a well-studied problem with a classical worst-case $\Omega(n \log…

Let $G$ be a graph of girth $g$ and circumference $c.$ A vertex $v$ of $G$ is called weakly pancyclic if $v$ lies on an $\ell$-cycle for every integer $\ell$ with $g\le \ell\le c.$ We prove that if $G$ is a nonbipartite graph of order $n\ge…

We provide a sufficient condition for a polynomial ring, not necessarily commutative, to have a first-order definition for the rational integers.