Related papers: Cactus, Pascal, and Pappus Point-Line Configuratio…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept…
Path-width of matroids naturally generalizes the better known parameter of path-width for graphs, and is NP-hard by a reduction from the graph case. While the term matroid path-width was formally introduced by Geelen-Gerards-Whittle [JCTB…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
The Galois group of a parameterized polynomial system of equations encodes the structure of the solutions. This monodromy group acts on the set of solutions for a general set of parameters, that is, on the fiber of a projection from the…
We present some methods for constructing connected spatial geometric configurations $(p_{q}, n_{k})$ of points and lines, preserved by the same rotations (and reflections) of Euclidean space $E^{3}$ as the chosen Platonic solid. In this…
This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…
A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…
We study the number of hamiltonian circuits, containing a fixed basis, and the number of hyperplanes, which do not contain a fixed basis in perfect matroid designs. Projective and affine finite geometries are considered as examples of such…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
The purpose of this paper is to study the famous Pappus configuration of $9$ lines and its dual arrangement. We show among others that by applying the Pappus Theorem to the dual arrangement we obtain the configuration corresponding to the…
Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points defines an edge, which has a Euclidean length in the configuration. A path is an ordered sequence of the points, and a…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…
Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the formulae are logical combinations of polynomial constraints.…
We provably compute the full set of rational points on 1403 Picard curves defined over $\mathbb{Q}$ with Jacobians of Mordell-Weil rank $1$ using the Chabauty-Coleman method. To carry out this computation, we extend Magma code of…
Let ${\mathcal K}$ denote a smooth conic in the complex projective plane. Pascal's theorem says that, given six points $A,B,C,D,E,F$ on ${\mathcal K}$, the three intersection points $AE \cap BF, AD \cap CF, BD \cap CE$ are collinear. This…
Numerical methods of approximate solution of the Cauchy problem for coupled systems of evolution equations are considered. Separating simpler subproblems for individual components of the solution achieves simplification of the problem at a…
We construct oriented matroids of rank 3 on 13 points whose realization spaces are disconnected. They are defined on smaller points than the known examples with this property. Moreover, we construct the one on 13 points whose realization…