English
Related papers

Related papers: Strong divisibility and lcm-sequences

200 papers

We consider typical finite dimensional complex irreducible representations of a basic classical simple Lie superalgebra, and give a sufficient condition on when unique factorization of finite tensor products of such representations hold. We…

Representation Theory · Mathematics 2024-04-02 Abhishek Das , Santosha Pattanayak

In a Dedekind domain $D$, every non-zero proper ideal $A$ factors as a product $A=P_1^{t_1}\cdots P_k^{t_k}$ of powers of distinct prime ideals $P_i$. For a Dedekind domain $D$, the $D$-modules $D/P_i^{t_i}$ are uniserial. We extend this…

Rings and Algebras · Mathematics 2018-02-13 Alberto Facchini , Zahra Nazemian

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

Logic in Computer Science · Computer Science 2024-04-24 Thaynara Arielly de Lima , Andréia Borges Avelar , André Luiz Galdino , Mauricio Ayala-Rincón

Let $a_1 = 1$ and, for $n > 1$, $a_n = a_{n-1} + a_{\left \lfloor \frac{n}{2} \right \rfloor}$. In this paper we will look at congruence properties and the growth rate of this sequence. First we will show that if $x \in \{1, 2, 3, 5, 6, 7…

Number Theory · Mathematics 2024-06-17 Wouter van Doorn

For an integral domain $R$ and a commutative cancellative monoid $M$, the ring consisting of all polynomial expressions with coefficients in $R$ and exponents in $M$ is called the monoid ring of $M$ over $R$. An integral domain is called…

Commutative Algebra · Mathematics 2020-03-10 Felix Gotti

In this paper we consider the formally symmetric differential expression $M[\cdot]$ of any order (odd or even) $\geq 2$. We characterise the dimension of the quotient space $D(T_{\max})/D(T_{\min})$ associated with $M[\cdot]$ in terms of…

Classical Analysis and ODEs · Mathematics 2007-05-23 K V Alice , V Krishna Kumar , A Padmanabhan

A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…

Group Theory · Mathematics 2020-05-26 Ravil Bildanov , Vadim Goryachenko , Andrey Vasil'ev

We have introduced and studied in [3] the class of Globalized multiplicatively pinched-Dedekind domains (GMPD domains). This class of domains could be characterized by a certain factorization property of the non-invertible ideals, (see [3,…

Commutative Algebra · Mathematics 2017-07-25 Shafiq ur Rehman

We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the…

General Mathematics · Mathematics 2024-11-08 Joseph M. Shunia

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

Combinatorics · Mathematics 2022-09-02 Varun Sivashankar

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Number Theory · Mathematics 2019-01-09 James Mc Laughlin

We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…

Number Theory · Mathematics 2022-06-24 Andrew Granville

For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as…

Information Theory · Computer Science 2016-09-01 Adam Woryna

Given a sequence ${\bf g}: g_0,\ldots, g_{m}$, in a finite group $G$ with $g_0=1_G$, let ${\bf \bar g}: \bar g_0,\ldots, \bar g_{m}$, be the sequence defined by $\bar g_0=1_G$ and $\bar g_i=g_{i-1}^{-1}g_i$ for $1\leq i \leq m$. We say that…

Group Theory · Mathematics 2024-04-02 Mohammad Javaheri

Let $S=\{x_1,x_2,\dots,x_n\}$ be a set of distinct positive integers, and let $f$ be an arithmetical function. The GCD matrix $(S)_f$ on $S$ associated with $f$ is defined as the $n\times n$ matrix having $f$ evaluated at the greatest…

Number Theory · Mathematics 2017-08-01 Pentti Haukkanen , László Tóth

It is proved that \[ \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N\exp\left(C\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right) \] holds for arbitrary integers $1\le n_1<\cdots < n_N$. This bound is essentially…

Number Theory · Mathematics 2015-01-21 Andriy Bondarenko , Kristian Seip

A classical problem, that goes back to the 1960's, is to characterize the integral domains R satisfying the property (IDn): "every singular nxn matrix over R is a product of idempotent matrices". Significant results, which describe this…

Commutative Algebra · Mathematics 2023-12-14 Laura Cossu , Paolo Zanardo

We consider three notions of divisibility in the Cuntz semigroup of a C*-algebra, and show how they reflect properties of the C*-algebra. We develop methods to construct (simple and non-simple) C*-algebras with specific divisibility…

Operator Algebras · Mathematics 2014-02-26 Leonel Robert , Mikael Rordam

The light-cone distribution amplitude (LCDA) of a heavy-light meson defined in heavy quark effective theory (HQET), is a fundamental nonperturbative input to account for innumerable $B$ meson exclusive decay and production processes. On the…

High Energy Physics - Phenomenology · Physics 2020-09-30 Saadi Ishaq , Yu Jia , Xiaonu Xiong , De-Shan Yang

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…

Number Theory · Mathematics 2021-03-09 Yongyi Chen , Tae Kyu Kim