Related papers: Constructions of Grassmannian Simplices

This small survey of basic universal constructions related to the actions of topological groups on compacta is centred around a new result --- an intrinsic description of extremely amenable topological groups (i.e., those having a fixed…

We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of…

In this paper we determine the irreducible projective representations of sporadic simple groups over an arbitrary algebraically closed field F, whose image contains an almost cyclic matrix of prime-power order. A matrix M is called cyclic…

For a given class ${\cal F}$ of uniform frames of fixed redundancy we define a Grassmannian frame as one that minimizes the maximal correlation $|< f_k,f_l >|$ among all frames $\{f_k\}_{k \in {\cal I}} \in {\cal F}$. We first analyze…

In this paper we describe a classifying theory for families of simplicial topological groups. If $B$ is a topological space and $G$ is a simplicial topological group, then we can consider the non-abelian cohomology $H(B,G)$ of $B$ with…

In the paper we present two examples of inductively free sporadic simplicial arrangements of 31 lines that are non-isomorphic, which allow us to answer negatively questions on the containment problem recently formulated by Drabkin and…

We simplify construction of Thoma representations of an infinite symmetric group

Let $G$ be a higher-rank semisimple Lie group over a nonarchimedean local field, for example $G={\rm PGL}(n,Q_P)$. To any lattice $L$ in $G$ there is an associated simplicial complex $B_L$, given by the quotient by $L$ of the Bruhat-Tits…

Equiangular tight frames are examples of Grassmannian line packings for a Hilbert space. More specifically, according to a bound by Welch, they are minimizers for the maximal magnitude occurring among the inner products of all pairs of…

We construct a finitely presented, infinite, simple group that acts by homeomorphisms on the circle, but does not admit a non-trivial action by $C^1$-diffeomorphisms on the circle. The group emerges as a group of piecewise projective…

We characterize the image of the Poisson transform on any distinguished boundary of a Riemannian symmetric space of the noncompact type by a system of differential equations. The system corresponds to a generator system of a two sided…

We construct Grassmannian categories of infinite rank, providing an infinite analogue of the Grassmannian cluster categories introduced by Jensen, King, and Su. Each Grassmannian category of infinite rank is given as the category of graded…

In this note we show that in the simplicial setting, the classifying space construction converts short exact sequences of groups not just to homotopy fibrations, but in fact to fibre bundles.

Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has…

In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

For any $n\geq 6$ we construct almost strongly minimal geometries of type $\bullet \overset{n}{-} \bullet \overset{n}{-}\bullet$ which are $2$-ample but not $3$-ample.