Related papers: Good Integers: A Comprehensive Review with Applica…
Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…
Two elements $a,b$ in a ring $R$ form a right coprime pair, written $\langle a,b\rangle$, if $aR+bR=R$. Right coprime pairs have shown to be quite useful in the study of left cotorsion or exchange rings. In this paper, we define the class…
A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…
Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite…
The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…
As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a…
A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we…
We study modules for the divided power algebra $D$ in a single variable over a commutative noetherian ring $k$. Our first result states that $D$ is a coherent ring. In fact, we show that there is a theory of Gr\"obner bases for finitely…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
A nonempty set $A\subset\mathbb{N}$ is $\ell$-strong Schreier if $\min A\geqslant \ell|A|-\ell+1$. We define a set of positive integers to be sparse if either the set has at most two numbers or the differences between consecutive numbers in…
Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…
Let $I$ be an ideal in a commutative Noetherian ring $R$. We say that a positive integer $\ell_0$ is the strong persistence index of $I$ if $\ell_0$ is the smallest integer such that $(I^{\ell+1} :_R I) = I^{\ell}$ for all $\ell \geq…
We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\mathbb{Z}_m$. We show that every integer $m = pq = 2^t -1$, where $p$,…
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…
Integer and fractional quantum Hall effects were studied with different physics models and explained by different physical mechanisms. In this paper, the common physical mechanism for integer and fractional quantum Hall effects is studied,…
Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…
An integer packing set is a set of non-negative integer vectors with the property that, if a vector $x$ is in the set, then every non-negative integer vector $y$ with $y \leq x$ is in the set as well. Integer packing sets appear naturally…
A \emph{congruence} on $\mathbb{N}^n$ is an equivalence relation on $\mathbb{N}^n$ that is compatible with the additive structure. If $\Bbbk$ is a field, and $I$ is a \emph{binomial ideal} in $\Bbbk[X_1,\dots,X_n]$ (that is, an ideal…
Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…
In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition ($mex$, for short), namely, the least positive missing integer in a partition. Subsequently, several authors have not only studied…