Related papers: Arndt and Carlitz Compositions
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
Compositional generalization is a basic and essential intellective capability of human beings, which allows us to recombine known parts readily. However, existing neural network based models have been proven to be extremely deficient in…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…
We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
A generally intelligent learner should generalize to more complex tasks than it has previously encountered, but the two common paradigms in machine learning -- either training a separate learner per task or training a single learner for all…
A composition of $n\in\NN$ is an ordered collection of one or more positive integers whose sum is $n$. The number of summands is called the number of parts of the composition. A palindromic composition of $n$ is a composition of $n$ in…
We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…
This paper presents an in-depth analysis of a parametrized version of the resolvent composition, an operation that combines a set-valued operator and a linear operator. We provide new properties and examples, and show that resolvent…
This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…
Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…
Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…
This paper is devoted to survey composition algebras and some of their applications. After overviewing the classical algebras of quaternions and octonions, both unital composition algebras (or Hurwitz algebras) and symmetric composition…
In this thesis we study three problems. The first is the superposition of the operators and their proprities, such as boundedness,continuity,regularity and the inequalities of the norms of the composition of functions in some functional…
We construct a functional model for rank one perturbations of compact normal operators acting in a certain Hilbert spaces of entire functions generalizing de Branges spaces. Using this model we study completeness and spectral synthesis…
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…