相关论文: On Products of Strong Skolem Starters

This paper concerns a class of combinatorial objects called Skolem starters, and more specifically, strong Skolem starters, which are generated by Skolem sequences. In 1991, Shalaby conjectured that any additive group $\mathbb{Z}_n$, where…

In 1991, Shalaby conjectured that any additive group $\mathbb{Z}_n$, where $n\equiv1$ or 3 (mod 8) and $n \geq11$, admits a strong Skolem starter and constructed these starters of all admissible orders $11\leq n\leq57$. Only finitely many…

In 1991, N. Shalaby conjectured that any additive group $\mathbb{Z}_n$, where $n\equiv1$ or 3 (mod 8) and $n \geq11$, admits a strong Skolem starter and constructed these starters of all admissible orders $11\leq n\leq57$. Shalaby and et…

In this note we present an alternative (simple) construction of cardioidal starters (strong and Skolem) for $\mathbb{Z}_{q^n}$, where $q\equiv3$ (mod 8) is an odd prime number and $n\geq1$ is an integer number; also for $\mathbb{Z}_{pq}$…

In this paper, we give new families of strong Skolem starters for $\mathbb{Z}_{p^n}$ and $\mathbb{Z}_{pq}$, for infinitely many odd primes $p,q\equiv1$ (mod 8) and $n>1$ be an integer.

A novel approach to building strong starters in cyclic groups of orders $n$ divisible by 3 from starters of smaller orders is presented. A strong starter in $Z_n$ ($n$ odd) is a partition of the set $\{1,2,\dots,n-1\}$ into pairs…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…

In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…

Recently, Lin introduced two new partition functions PD$_t(n)$ and PDO$_t(n)$, which count the total number of tagged parts over all partitions of $n$ with designated summands and the total number of tagged parts over all partitions of $n$…

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

This paper includes a series of structural results for von Neumann algebras arising from measure preserving actions by product groups on probability spaces. Expanding upon the methods used earlier by the first two authors \cite{CS}, we…

We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to…

We study strongly graded vertex algebras and their strongly graded modules, which are conformal vertex algebras and their modules with a second, compatible grading by an abelian group satisfying certain grading restriction conditions. We…

We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

We study the problem of rationality of an infinite series of components, the so-called Ein components, of the Gieseker-Maruyama moduli space $M(e,n)$ of rank 2 stable vector bundles with the first Chern class $e=0$ or -1 and all possible…

In this paper, using crystal theory we prove the existence of a new family of irreducible components appearing in the tensor product of two irreducible integrable highest weight modules over symmetrizable Kac-Moody algebras motivated by the…