Related papers: Desargues theorem, its configurations, and the sol…
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated…
This article aims to explain the Nested Benders algorithm for the solution of large-scale stochastic programming problems in a way that is intelligible to someone coming to it for the first time. In doing so it gives an explanation of…
We study the ergodic problem for fully nonlinear operators which may be singular or degenerate when the gradient of solutions vanishes. We prove the convergence of both explosive solutions and solutions of Dirichlet problems for…
Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with…
A long-standing conjecture is that any transitive finite projective plane is Desarguesian. We make a contribution towards a proof of this conjecture by showing that a group acting transitively on the the points of a…
Base on a conjecture, we prove that for any smooth separated stack of finite type over a number field, its descent obstruction equals its iterated descent obstruction. As a consequence, we show that for any algebraic stack over a number…
We consider a one-dimensional singularly perturbed 4th order problem with the additional feature of a shift term. An expansion into a smooth term, boundary layers and an inner layer yields a formal solution decomposition, and together with…
In this paper, we provide a systematic way of finding explicit solutions for a class of continuous fragmentation equations with growth or decay in the state space and derive explicit solutions in the cases of constant and linear…
Solving a system of polynomial equations is a ubiquitous problem in the applications of mathematics. Until recently, it has been hopeless to find explicit solutions to such systems, and mathematics has instead developed deep and powerful…
Multivariate information decompositions hold promise to yield insight into complex systems, and stand out for their ability to identify synergistic phenomena. However, the adoption of these approaches has been hindered by there being…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We give an interpretation of the construction of torsors from preceding work (Bertram, Kinyon: Associative Geometries. I, J. Lie Theory 20) in terms of classical projective geometry. For the Desarguesian case, this leads to a reformulation…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
In this paper we show that it is possible to project onto the solutions of the $\mathfrak{grt}$ hexagon equation. We also consider in some sense generalized hexagon equations and other symmetry equations for multiple argument maps between…
It is proved the existence of large algebraic structures \break --including large vector subspaces or infinitely generated free algebras-- inside, among others, the family of Lebesgue measurable functions that are surjective in a strong…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…