Related papers: Hyperplanes in Configurations, decompositions, and…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
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…
The main result of this note is that the shift of the parameter by 1 in the parameter space of decomposing measures in the problem of harmonic analysis on the infinite-dimensional unitary group corresponds to the taking of the reduced Palm…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…
A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…
We compute the convex hull in $\mathbb{C}^2$ of an arbitrary finite subgroup of ${\mathbb{C}^*}^2$. The combinatorics are dictated by continued fractions in a natural way. This reproves a theorem of Smilansky, with a slightly stronger…
A central question in the theory of hyperplane arrangements is when the complement of a complex arrangement is aspherical. Barkley and Speyer introduced a class of real arrangements that are called "clean," and Yoshinaga proved that every…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
The concept of separation by hyperplanes is fundamental for convex geometry and its tropical (max-plus) analogue. However, analogous separation results in max-min convex geometry are based on semispaces. This paper answers the question…
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational benefits for solving convex mixed-integer nonlinear programs.…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We give some sufficient conditions of separation of two sets of integer points by a hyperplane. Our conditions are related to the notion of convexity of sets of integer points and are weaker than existing notions.
In this paper, we introduce the $k$-adjoint of a given hyperplane arrangement $\mathcal{A}$ associated with rank-$k$ elements in the intersection lattice $L(\mathcal{A})$, which generalizes the classical adjoint proposed by Bixby and…
We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…
These lecture notes are based on lectures given by the author at the summer school "Arrangements in Pyr\'en\'ees" in June 2012. We survey and compare various compactifications of complex hyperplane arrangement complements. In particular, we…
Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…
Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…
The cartesian structure possessed by relations, spans, profunctors, and other such morphisms is elegantly expressed by universal properties in double categories. Though cartesian double categories were inspired in part by the older program…