Related papers: Symmetrically Constrained Compositions
The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…
We examine and implement the concept of non-additive composition laws in the quantum theory of closed bosonic strings moving in (3+1)-dimensional Minkowski space. Such laws supply exact selection rules for the merging and splitting of…
In this article, we explore the combinatorics of balanced collections. A collection of subsets of the set $[n] = \{1, \dots, n\}$ is called \emph{balanced} if the relative interior of the convex hull of the corresponding characteristic…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
For $\widetilde{\cal R} = 1 - \exp(- {\cal R})$ a random closed set obtained by exponential transformation of the closed range ${\cal R}$ of a subordinator, a regenerative composition of generic positive integer $n$ is defined by recording…
Synchronous systems provide a basic model of embedded systems and industrial systems are modeled as Simulink diagrams and/or Lustre programs. Although the test generation problem is critical in the development of safe systems, it often…
The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…
Recently, a framework for computing the symmetry-resolved entanglement entropy for non-invertible symmetries in $1{+}1$d conformal field theories has been proposed by Saura-Bastida, Das, Sierra and Molina-Vilaplana [Phys. Rev. D109,…
In this paper, we study weighted composition operators on Bergman spaces of analytic functions which are square integrable on polydisk. We develop the study in full generality, meaning that the corresponding weighted composition operators…
The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…
For every irreducible complex representation~$\pi_\lambda$ of the symmetric group~$\S_n$, we construct, in a canonical way, a so-called intrinsic hyperplane arrangement~$\A_{\lambda}$ in the space of~$\pi_\lambda$. This arrangement is a…
We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower…
The structure set $\ST^{TOP}(M)$ of an $n$-dimensional topological manifold $M$ for $n \geqslant 5$ has a homotopy invariant functorial abelian group structure, by the algebraic version of the Browder-Novikov-Sullivan-Wall surgery theory.…
We consider the asymptotics of sums of the form $$ \frac1{F_n^\sigma} \sum_{m = 1}^{F_n-1} \frac{f(m/F_n)}{\left|{\sin(\pi m/F_n)}\right|^\sigma} \frac{f(F_{n-1}m/F_n)}{\left|{\sin(\pi F_{n-1}m/F_n)}\right|^\sigma} $$ where $(F_n)_{n \in…
We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from identical components. Symmetry is an important goal in the design of distributed systems,…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
We consider the symmetric group $S_n$-module of the polynomial ring with $m$ sets of $n$ commuting variables and $m'$ sets of $n$ anti-commuting variables and show that the multiplicity of an irreducible indexed by the partition $\lambda$…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
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…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…