Related papers: Effective atypical intersections and applications …

In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

The mutual compatibility of the dynamical equations and constraints describing a massive particle of arbitrary spin, though essential for consistency, is generically lost in the presence of interactions. The conventional Lagrangian approach…

The rational homology of unordered configuration spaces of points on any surface was studied by Drummond-Cole and Knudsen. We compute the rational cohomology of configuration spaces on a closed orientable surface, keeping track of the mixed…

In this paper, we propose new algorithms for finding a common point of the solution set of a pseudomonotone equilibrium problem and the set of fixed points of a symmetric generalized hybrid mapping in a real Hilbert space. The convergence…

Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure…

In their recent paper [KNS2019], the first author, S. Kiriki, and T. Soma introduced a concept of pointwise emergence to measure the complexity of irregular orbits. They constructed a residual subset of the full shift with high pointwise…

We describe the closures of locally divergent orbitsunder the action of tori on Hilbert modular spaces of rank r = 2. In particular, we prove that if D is a maximal R-split torus acting on a real Hilbert modular space then every locally…

We consider arbitrary orderings of the edges entering each vertex of the (downward directed) Pascal graph. Each ordering determines an adic (Bratteli-Vershik) system, with a transformation that is defined on most of the space of infinite…

A set of segments in the plane may form a Euclidean TSP tour or a matching, among others. Optimal TSP tours as well as minimum weight perfect matchings have no crossing segments, but several heuristics and approximation algorithms may…

The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…

The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…

We present a novel algorithm for (i) detecting approximate symmetries inherently present among spatially localized molecular orbitals and (ii) enforcing these in numerically exact manners by means of unitary optimization techniques. The…

For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…

We propose an axiomatic approach towards studying unlikely intersections by introducing the framework of distinguished categories. This includes commutative algebraic groups and mixed Shimura varieties. It allows us to define all basic…

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

We discuss the relationship between o-minimality and the so called Zilber-Pink conjecture. Since the work of Pila and Zannier, algebraization theorems in o-minimal geometry had profound impacts in Diophantine geometry (most notably on the…

We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…