Related papers: S-Restricted Compositions Revisited
By a "Boolean inverse semigroup" we mean an inverse semigroup whose semilattice of idempotents is a Boolean algebra. We study representations of a given inverse semigroup S in a Boolean inverse semigroup which are "tight" in a certain well…
Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
We define a quantity $c_m(n,k)$ as a generalization of the notion of the composition of the positive integer $n$ into $k$ parts. We proceed to derive some known properties of this quantity. In particular, we relate two partial Bell…
Given a finite set of primes $S$ and a $m$-tuple $(a_1,\dots,a_m)$ of positive, distinct integers we call the $m$-tuple $S$-Diophantine, if for each $1\leq i < j\leq m$ the quantity $a_ia_j+1$ has prime divisors coming only from the set…
We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…
Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
In this paper, for a given family of constraints and the classical Cantor distribution we determine the constrained optimal sets of $n$-points, $n$th constrained quantization errors for all positive integers $n$. We also calculate the…
Motivated by applications in polymer-based data storage, we study the problem of reconstructing a string from part of its composition multiset. We give a full description of the structure of the strings that cannot be uniquely reconstructed…
In this note, I discuss results on integer compositions/partitions given in the paper "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions". I also experiment with four…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…
We provide closed formulas for (unique) solutions of nonhomogeneous Dirichlet problems on balls involving any positive power $s>0$ of the Laplacian. We are able to prescribe values outside the domain and boundary data of different orders…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…
We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the…
In [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…