Related papers: Whitney's Theorem, Triangular Sets and Probabilist…
The main purpose of this paper is to present a kneading theory for two-dimensional triangular maps. This is done by defining a tensor product between the polynomials and matrices corresponding to the one-dimensional basis map and fiber map.…
A stochastic algorithm is proposed, finding the set of generalized means associated to a probability measure on a compact Riemannian manifold M and a continuous cost function on the product of M by itself. Generalized means include p-means…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
Many open problems and important theorems in low-dimensional topology have been formulated as statements about certain 2--complexes called gropes. This paper describes a precise correspondence between embedded gropes in 4--manifolds and the…
We use a triple-point version of the Whitney trick to show that ornaments of three orientable $(2k-1)$-manifolds in $\mathbb R^{3k-1}$, $k>2$, are classified by the $\mu$-invariant. A very similar (but not identical) construction was found…
As is well-known, the Witten deformation of the De Rham complex computes the De Rham cohomology. In this paper we study the Witten deformation on a noncompact manifold and restrict it to differential forms which behave polynomially near…
While the existence of low-dimensional embedding manifolds has been shown in patterns of collective motion, the current battery of nonlinear dimensionality reduction methods are not amenable to the analysis of such manifolds. This is mainly…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
We extend the Marsden-Weinstein-Meyer symplectic reduction theorem to the setting of multisymplectic manifolds. In this context, we investigate the dependence of the reduced space on the reduction parameters. With respect to a distinguished…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
Supervised manifold learning methods learn data representations by preserving the geometric structure of data while enhancing the separation between data samples from different classes. In this work, we propose a theoretical study of…
Recent work on weighted model counting has been very successfully applied to the problem of probabilistic inference in Bayesian networks. The probability distribution is encoded into a Boolean normal form and compiled to a target language,…
In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which…
We present an overarching framework for stable spectral methods on a triangle, defined by a multivariate W-system and based on orthogonal polynomials on the triangle. Motivated by the Koornwinder orthogonal polynomials on the triangle, we…
In a recent paper, the authors proposed a general methodology for probabilistic learning on manifolds. The method was used to generate numerical samples that are statistically consistent with an existing dataset construed as a realization…
We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…