相关论文: Maps between higher Bruhat orders and higher Stash…

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps are in bijection with West-2-stack-sortable permutations, beta(1,0)-trees introduced by Cori, Jacquard and Schaeffer…

P. Broussous and S. Stevens studied maps between enlarged Bruhat-Tits buildings to construct types for p-adic unitary groups. They needed maps which respect the Moy-Prasad filtrations. That property is called (CLF), i.e. compatibility with…

In this paper we study the Hessian map $h_{d,r}$ which associates to any hypersurface of degree $d$ in ${\mathbb P}^r$ its Hessian hypersurface. We study general properties of this map and we prove that: $h_{d,1}$ is birational onto its…

The equivariant Kazhdan-Lusztig polynomial of a braid matroid may be interpreted as the intersection cohomology of a certain partial compactification of the configuration space of n distinct labeled points in the plane, regarded as a graded…

We show that, for any prime power p^k and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into p^k convex sets with equal volume and equal surface area. We derive this result from a more…

Let $d\geq2$ be an integer. The set $\mathbf{F}(d)$ of foliations of degree $d$ on the complex projective plane can be identified with a Zariski's open set of a projective space of dimension $d^2+4d+2$ on which $\mathrm{Aut}(\mathbb…

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with…

One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

We show that there are $n!$ matchings on $2n$ points without, so called, left (neighbor) nestings. We also define a set of naturally labeled $(2+2)$-free posets, and show that there are $n!$ such posets on $n$ elements. Our work was…

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…

In the present work, we extract pairs of topological spaces from maps between coloured operads. We prove that those pairs are weakly equivalent to explicit algebras over the one dimensional Swiss-Cheese operad SC_{1}. Thereafter, we show…

The order topology $\tau_o(P)$ (resp. the sequential order topology $\tau_{os}(P)$) on a poset $P$ is the topology that has as its closed sets those that contain the order limits of all their order convergent nets (resp. sequences). For a…

In this expository note we present a proof of the V.A. Vassiliev conjecture on the planarity of graphs with vertices of degree 4 and certain additional structure. Both statement and proof are accessible to high-school students familiar with…

The classes of odd graphs $O_n$ and middle levels graphs $B_n$ form one parameter subclasses of the Kneser graphs and bipartite Kneser graphs respectively. In particular both classes are vertex transitive while resisting definitive…

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…