Related papers: Partitions of $n$-valued maps
Multivariable, real-valued functions induce matrix-valued functions defined on the space of d-tuples of n-times-n pairwise-commuting self-adjoint matrices. We examine the geometry of this space of matrices and conclude that the best notion…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
Picture-valued invariants are the main achievement of parity theory by V.O. Manturov. In the paper we give a general description of such invariants which can be assigned to a parity (in general, a trait) on diagram crossings. We distinguish…
The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online platforms. Little is known, however, about the characteristics…
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the agents. The task is to partition the graph into $k$…
We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
The $\lambda$-core vertices of a graph correspond to the non-zero entries of some eigenvector of $\lambda$ for a universal adjacency matrix $\mathbf{U}$ of the graph. We define a partition of the vertex set $V$ based on the $\lambda$-core…
We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We moreover characterize when the vertex model can be taken so…
An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
We discuss the dynamical, topological, and algebraic classification of rational maps $f$ of the Riemann sphere to itself each of whose critical points $c$ is also a fixed-point of $f$, i.e. $f(c)=c$.
We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…
Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
In this paper, we characterize stratifiable (or semi-stratifiable) spaces, and monotonically countably paracompact (or monotonically countably metacompact) spaces by expansions of locally upper bounded semi-continuous poset-valued maps.…
Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays…
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…