Related papers: Characterization of generic parameter families of …

Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…

The germ of the universal isomonodromic deformation of a logarithmic connection on a stable n-pointed genus g curve always exists in the analytic category. The first part of this paper investigates under which conditions it is the analytic…

We provide a new way of simultaneously parametrizing arbitrary local CR maps from real-analytic generic manifolds $M\subset {\mathbb C}^N$ into spheres ${\mathbb S}^{2N'-1}\subset {\mathbb C}^{N'}$ of any dimension. The parametrization is…

Random $K$-satisfiability ($K$-SAT) is a model system for studying typical-case complexity of combinatorial optimization. Recent theoretical and simulation work revealed that the solution space of a random $K$-SAT formula has very rich…

We study constrained clustering, where constraints guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the…

Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…

We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the…

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…

This work introduces a family of univariate constrained mixtures of generalized normal distributions (CMGND) where the location, scale, and shape parameters can be constrained to be equal across any subset of mixture components. An…

In this paper we introduce a homotopy theoretic technique for proving that the $K$-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically…

We consider CR submersive mappings between generic submanifolds in complex space. We show that, under suitable conditions on the manifolds, there is an integer k such that any jet of the CR mapping at a given point is a rational function of…

This paper is a survey of the generalized Hamiltonian gradient flow (GHGF) framework for Hamilton-Jacobi equations, with an emphasis on the propagation of singularities and its connections to weak KAM theory, optimal transport and mean…

In his groundbreaking work on classification of singularities with regard to right and stable equivalence of germs, Arnold has listed normal forms for all isolated hypersurface singularities over the complex numbers with either modality…

We investigate a Gaussian mixture model (GMM) with component means constrained in a pre-selected subspace. Applications to classification and clustering are explored. An EM-type estimation algorithm is derived. We prove that the subspace…

Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…

Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…

In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

We describe the equivalence classes of germs of generic 1-parameter families of complex vector fields z dot = omega_epsilon(z) on C unfolding a singular point of multiplicity k+1: omega_0 = z^{k+1} + o(z^{k+1}). The equivalence is under…

We study gauge theories on spacetime manifolds with a codimension-$1$ submanifold with boundary. We characterise the reduced phase space of the theory whenever it is described by a local momentum map for the action of the gauge group…