Related papers: Arndt and Carlitz Compositions
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
We characterize the compactness of composition operators; in term of generalized Nevanlinna counting functions, on a large class of Hilbert spaces of analytic functions, which can be viewed between the Bergman and the Dirichlet spaces
An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…
Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…
Building upon the linear version of mixed summable sequences in arbitrary Banach spaces of A. Pietsch, we introduce a nonlinear version of his concept and study its properties. Extending previous work of J. D. Farmer, W. B. Johnson and J.…
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
A new approach to problems of the Uncertainty Principle in Harmonic Analysis, based on the use of Toeplitz operators, has brought progress to some of the classical problems in the area. The goal of this paper is to develop and systematize…
We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…
In this paper we deal with unbounded composition operators defined in Orlicz spaces. Indeed, we provide some necessary and sufficient condition for densely definedness of composition operators on Orlicz spaces. Also, we will investigate the…
The idea of using Riedtmann's well-behaved functors to study compositions of irreducible morphisms has been explored in a number of articles. Here we introduce the concept of mesh-comparable components of the Auslander-Reiten quiver, which…
We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…
Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…
In this paper we characterize some basic properties of composition operators on the spaces of harmonic Bloch functions. First we provide some equivalent conditions for boundedness and compactness of composition operators. Then by using…
We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…
There has been an everlasting discussion around the concept of form in music. This work is motivated by such debate by using a complex systems framework in which we study the form as an emergent property of rhythm. Such a framework…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…