Related papers: Geometric Bruhat order on (0,1)-matrices
In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…
We consider a special class of linear and quadratic Poisson brackets related to ODE systems with matrix variables. We investigate general properties of such brackets, present an example of a compatible pair of quadratic and linear brackets…
Geometric Invariant Theory (GIT) produces quotients of algebraic varieties by reductive groups. If the variety is projective, this quotient depends on a choice of polarisation; by work of Dolgachev-Hu and Thaddeus, it is known that two…
The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…
Each point $x$ in Gr$(r,n)$ corresponds to an $r \times n$ matrix $A_x$ which gives rise to a matroid $M_x$ on its columns. Gel'fand, Goresky, MacPherson, and Serganova showed that the sets $\{y \in \mathrm{Gr}(r,n) | M_y = M_x\}$ form a…
This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…
We study a birational map associated to any finite poset P. This map is a far-reaching generalization (found by Einstein and Propp) of classical rowmotion, which is a certain permutation of the set of order ideals of P. Classical rowmotion…
In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…
Inspired by the Weak Lefschetz Principle, we study when a smooth projective variety fully determines the birational geometry of some of its subvarieties. In particular, we consider the natural embedding of the space of complete quadrics…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
We provide necessary and sufficient conditions on the derived type of a vector field distribution $\Cal V$ in order that it be locally equivalent to a partial prolongation of the contact distribution $\Cal C^{(1)}_q$, on the first order jet…
We investigate Bruhat-Tits buildings and their compactifications by means of Berkovich analytic geometry over complete non-Archimedean fields. For every reductive group G over a suitable non-Archimedean field k we define a map from the…
We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.
This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
We study the notion of a birational Chow-K\"unneth decomposition, which is essentially a decomposition of the integral birational motive of a variety. The existence of a birational Chow-K\"unneth decomposition is stably birationally…
Matrix Schubert varieties are certain varieties in the affine space of square matrices which are determined by specifying rank conditions on submatrices. We study these varieties for generic matrices, symmetric matrices, and upper…
We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…