Related papers: Congruence successions in compositions

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

An infinite continued composition is an expression of the form \begin{equation*} \lim_{n\to\infty}t_0\circ t_1 \circ t_2 \circ \cdots \circ t_n(c)\;, \end{equation*} where the $t_i$ are maps from a set $D$ to itself, the initial value $c$…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Compositional generalization is the capacity to recognize and imagine a large amount of novel combinations from known components. It is a key in human intelligence, but current neural networks generally lack such ability. This report…

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…

In the theory of continued fractions, Zaremba's conjecture states that there is a positive integer $M$ such that each integer is the denominator of a convergent of an ordinary continued fraction with partial quotients bounded by $M$. In…

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In…

Congruences for stochastic automata are defined, the correspondin factor automata are constructed and investigated for automata ove analytic spaces. We study the behavior under finite and infinite streams. Congruences consist of multiple…

A composition $\pi=\pi_1\pi_2\cdots\pi_k$ of a positive integer $n$ is an ordered collection of one or more positive integers whose sum is $n$ . The number of summands, namely $k$, is called the number of parts of $\pi$. In this paper, we…

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are…

Compositionality in language refers to how much the meaning of some phrase can be decomposed into the meaning of its constituents and the way these constituents are combined. Based on the premise that substitution by synonyms is…