Related papers: Weakly Divisible Rings

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

We classify all positive n-particle N^kMHV Yangian invariants in N=4 Yang-Mills theory with n=5k, which we call extremal because none exist for n>5k. We show that this problem is equivalent to that of enumerating plane cactus graphs with k…

We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…

Let $f_n(k)$ be the number of subrings of index $k$ in $\mathbb{Z}^n$. We show that results of Brakenhoff imply a lower bound for the asymptotic growth of subrings in $\mathbb{Z}^n$, improving upon lower bounds given by Kaplan, Marcinek,…

The covering number of an associative ring $R$ is the minimal number of proper subrings whose union is $R$. We establish a strategy to classify unital rings of a given finite covering number, and obtain a classification of unital rings…

The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…

Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…

Minimizing divergence measures under a constraint is an important problem. We derive a sufficient condition that binary divergence measures provide lower bounds for symmetric divergence measures under a given triangular discrimination or…

An explicit form of first order PDE for invariants of binary form are found. By solving the equation a minimal generation set for a ring of invariants and theirs syzygies are calculated in the cases $n\leq 6$ and $n=8.$

Let $\alpha$ be a complex number. We show that there is a finite subset $F$ of the ring of the rational integers $\mathbb{Z}$, such that $F\left[ \alpha\right] =\mathbb{Z}\left[ \alpha\right]$, if and only if $\alpha$ is an algebraic number…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…

This paper continues the study of the reduced ring order (rr-order) in reduced rings where $a< b$ if $a^2= ab$. A reduced ring is called rr-good if it is a lower semi-lattice in the order. Examples include weakly Baer rings (wB or PP-rings)…

The notion of weakly separable extensions was introduced by N. Hamaguchi and A. Nakajima as a generalization of separable extensions. The purpose of this article is to give a characterization of weakly separable polynomials in skew…

We will strengthen the known upper and lower bounds on the delta-crossing number of knots in therms of the triple-crossing number. The latter bound turns out to be strong enough to obtain (unknown values of) triple-crossing numbers for a…

A dominating set on an $n $-dimensional hypercube is equivalent to a binary covering code of length $n $ and covering radius 1. It is still an open problem to determine the domination number $\gamma(Q_n)$ for $ n\geq10$ and $…

We introduce a weak division-like property for noncommutative rings: a nontrivial ring is fadelian if for all nonzero $a,x$ there exist $b,c$ such that $x=ab+ca$. We prove properties of fadelian rings, and construct examples of such rings…

We show that if a Barker sequence of length $n>13$ exists, then either $n=3979201339721749133016171583224100$, or $n > 4\cdot10^{33}$. This improves the lower bound on the length of a long Barker sequence by a factor of nearly 2000. We also…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Replacing invertibility with quasi-invertibility in Bass' first stable range condition we discover a new class of rings, the QB-rings. These constitute a considerable enlargement of the class of rings with stable rank one (B-rings), and…