Related papers: m-submultisets and m-permutations of multisets ele…
Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
In this paper, we develop the theory of symmetric triads with multiplicities. First, we classify abstract symmetric triads with multiplicities. Second, we determine the symmetric triads with multiplicities corresponding to commutative…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
This article introduces patterns of ideals of numerical semigroups, thereby unifying previous definitions of patterns of numerical semigroups. Several results of general interest are proved. More precisely, this article presents results on…
In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…
Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…
We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1,...,n} occurs k times, where k may depend on n. This generalizes the famous…
Multiscale models allow for the treatment of complex phenomena involving different scales, such as remodeling and growth of tissues, muscular activation, and cardiac electrophysiology. Numerous numerical approaches have been developed to…
We consider a set of cliques in any multipartite graph with two vertices in each part. Moreover, we construct a class of peculiar polytopes. Key words: multipartite graph, clique, polytope.
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…
In this work, we find the Poisson superalgebras related to schemes of quantization. Initially, we consider the Dirac superbracket in the context of the quantization of constrained systems. Next, we show the existence of a Poisson…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
A deflatable permutation class is one in which the simple permutations are contained in a proper subclass. Deflatable permutation classes are often easier to describe and enumerate than non-deflatable ones. Some theorems which guarantee…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane P2. They are used in the studies of resonance and characteristic varieties of complex hyperplane arrangement complements and…
In this note we introduce the poset of $m$-multichains of a given poset $\mathcal{P}$. Its elements are the multichains of $\mathcal{P}$ consisting of $m$ elements, and its partial order is the componentwise partial order of $\mathcal{P}$.…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
We calculate the outerplanar crossing numbers of complete multipartite graphs which have $n$ partite sets with $m$ vertices and one partite set with $p$ vertices, where either $p|mn$ or $mn|p$.