Related papers: Cactus, Pascal, and Pappus Point-Line Configuratio…
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…
Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based on identifying vertex covers of the conflict graph of the…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
In the first part of this paper we study scrollers and linearly joined varieties. A particular class of varieties, of important interest in classical Geometry are Cohen--Macaulay varieties of minimal degree. They appear naturally studying…
The search for optimal configurations of pointsets, the most notable examples being the problems of Kepler and Thompson, have an extremely rich history with diverse applications in physics, chemistry, communication theory, and scientific…
The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that…
We give geometric characterisations of patch and Lawson topologies in the context of predicative point-free topology using the constructive notion of located subset. We present the patch topology of a stably locally compact formal topology…
The decomposition of polynomial spaces on unions of Grassmannians $\mathcal G_{{k_1},d}\cup\ldots\cup \mathcal G_{{k_r},d}$ into irreducible orthogonally invariant subspaces and their reproducing kernels are investigated. We also generalize…
(EN) We revise the famous algorithm for symmetric tensor decomposition due to Brachat, Comon, Mourrain and Tsidgaridas. Afterwards, we generalize it in order to detect possibly different decompositions involving points on the tangential…
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
We propose a globally convergent numerical method to compute solutions to a general class of quasi-linear PDEs with both Neumann and Dirichlet boundary conditions. Combining the quasi-reversibility method and a suitable Carleman weight…
Given a smooth, proper, geometrically integral curve $X$ of genus $g$ with Jacobian $J$ over a number field $K$, Chabauty's method is a $p$-adic technique to bound $\# X(K)$ when $\mathrm{rank}\ J(K) < g$. We study limitations of a variant…
This paper investigates several classical and novel variations of the Erd\H{o}s--Szekeres problem, including multicolored point sets, convex hexagons with a given number of interior points, and polygons with constraints on edge colors. We…
A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a…
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…
A new concept, decomposition-unstable (DU) variety of a parametric polynomial system, is introduced in this paper and the stabilities of several triangular decomposition methods, such as characteristic set decomposition, relatively…