Related papers: Perfect Skolem sets

An algebra $S$ is called a Skolem-Noether algebra (SN algebra for short) if for every central simple algebra $R$, every homomorphism $R\to R\otimes S$ extends to an inner automorphism of $R\otimes S$. One of the important properties of such…

A set $A$ of positive integers is said to be Schreier if either $A = \emptyset$ or $\min A\ge |A|$. We give a bijective map to prove the recurrence of the sequence $(|\mathcal{K}_{n, p, q}|)_{n=1}^\infty$ (for fixed $p\ge 1$ and $q\ge 2$),…

A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positive integers (m_1,m_2,...) such that m_1=1, every nonnegative…

Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

For all positive even integers $n$, graphs of order $n$ with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the study of a labeling problem in \cite{IMO}. This fact…

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

We give equivalent conditions for a monomial sequence to be a d-sequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal…

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

A Sidon sequence is a sequence of integers a_1 < a_2 < a_3 < ... with the property that the sums a_i+a_j (i\le j) are distinct. This work contains a survey of Sidon sequences and their generalizations, and an extensive annotated and…

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…

Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,..., x_n]$ generated by monomials $u_1,u_2,..., u_t$. We show that $S/I$ is pretty clean if either: 1) $u_1,u_2,..., u_t$ is a filter-regular sequence, 2)…

In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

Let $X_n = \{1,2,\dots,n\}$ be a finite set $(n\geq 2)$ and $T_n$ the full transformation semigroup on $X_n$. For a positive integer $l\leq n-1$, we define $$T_n(l) = \{\alpha\in T_n \colon \forall x,y\in X_n,\, |x-y| = l \;\Rightarrow\;…

Let $n\in \mathbb{N}$ and $d_1 \geq d_2 \geq d_n\geq 1$ be integers. There is characterization of when $(d_1, d_1, \ldots, d_n)$ is the degree sequence of a graph containing a perfect matching, due to results of Lov\'{a}sz (1974) and…

Semi-regular sequences over $\mathbb{F}_2$ are sequences of homogeneous elements of the algebra $ B^{(n)}=\mathbb{F}_2[X_1,...,X_n]/(X_1^2,...,X_n^2) $, which have as few relations between them as possible. They were introduced in order to…

The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…