Related papers: Geometric view of interval poset permutations
We compute all the equivariant Euler characteristics of the $\Sigma_n$-poset of partitions of the $n$ element set.
The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…
We survey the progress on the study of symplectic geometry past five decades. The survey focuses on the convexity properties of a moment map, the classification of symplectic actions, the symplectic embedding problems, and the theory of…
An \emph{interval vector} is a $(0,1)$-vector in $\mathbb{R}^n$ for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of interval vectors in $\mathbb{R}^n$. We study three particular…
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time, CAT for short. We refine the tree traversal, a method…
We propose an inverse approach for dealing with interval maps based on the manner whereby their branches are related (folding property), instead of addressing the map equations as a whole. As a main result, we provide a symmetry-breaking…
Intersection bodies represent a remarkable class of geometric objects associated with sections of star bodies and invoking Radon transforms, generalized cosine transforms, and the relevant Fourier analysis. The main focus of this article is…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
A notion of orthogonality in multisymplectic geometry has been developed by Cantrijn, Ibort and de Le\'on and used by many authors. In this paper, we review this concept and propose a new type of orthogonality in multisymplectic geometry;…
We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…
In this paper we study how certain symmetries of convex bodies affect their geometric properties. In particular, we consider the impact of symmetries generated by the block diagonal subgroup of orthogonal transformations, generalizing…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…
A $\sqrt{n}$ estimate in the hyperplane problem with arbitrary measures has recently been proved in \cite{K3}. In this note we present analogs of this result for sections of lower dimensions and in the complex case. We deduce these…
We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are called permutations. The…
In this paper we survey several intersection and non-intersection phenomena appearing in the realm of symplectic topology. We discuss their implications and finally outline some new relations of the subject to algebraic geometry.