Related papers: A note on M\"{o}bius functions of upho posets

An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…

The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…

In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…

We characterize, up to a conjecture, probability distributions of all order finite moments having ultraspherical type generating functions for orthogonal polynomials.

We propose a unified view of the polarity of functions, that encompasses all specific definitions, generalizes several well-known properties and provides new results. We show that bipolar sets and bipolar functions are isomorphic lattices.…

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

In this paper, we will study the M\"obius polynomial, an invariant of ranked posets that arises in the study of splitting algebras. We will present a formula for the M\"obius polynomial of the direct product of posets in terms of the…

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

The confluent binomial posets with the atomic function A(n) = max (1,2^(n-2)) are classified. In particular, it is shown that in general there are non-isomorphic intervals of the same length.

Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are well-founded, the associated Boolean ultrapower embeddings…

In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the…

Linear fractional transformations on the extended complex plane are classified up to topological conjugacy. Recall that two transformations f and g are called topologically conjugate if there exists a homeomorphism h such that hg=fh.

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Motivated by the work of Panina and her coauthors on cyclopermutohedron we study a poset whose elements correspond to equivalence classes of partitions of the set $\{1,\cdots, n+1\}$ up to cyclic permutations and orientation reversion. This…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…

We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…

We show that for two quivers without oriented cycles related by a BGP reflection, the posets of their tilting modules are related by a simple combinatorial construction, which we call flip-flop. We deduce that the posets of tilting modules…

A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this…