Related papers: m-submultisets and m-permutations of multisets ele…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.
The goals of this expository article are on one hand to describe how to construct ($m$-) cluster categories from triangulations (resp. from $m+2$-angulations) of polygons. On the other hand, we explain how to use translation quivers and…
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…
We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…
This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are…
We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.
Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…