Related papers: Nonlinear embeddings: Applications to analysis, fr…

The aim of the paper is to answer the following question: does $\kappa$-deformation fit into the framework of noncommutative geometry in the sense of spectral triples? Using a compactification of time, we get a discrete version of…

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

We present a new paradigm for speeding up randomized computations of several frequently used functions in machine learning. In particular, our paradigm can be applied for improving computations of kernels based on random embeddings. Above…

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

This paper deals with the extension of partial actions of topological groups on topological spaces. Within this framework, we introduce a class of topological embeddings defined via the inverse semigroup of homeomorphisms between open…

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…

We introduce new manifold-based splines that are able to exactly reproduce B-splines on unstructured surface meshes. Such splines can be used in isogeometric analysis (IGA) to represent smooth surfaces of arbitrary topology. Since prevalent…

Let $\kappa_e(\overline{M}_{g,n})$ denote the kappa ring of $\overline{M}_{g,n}$ in codimension $e$. For $g,e\geq 0$ fixed, as the number $n$ of the markings grows large we show that the rank of $\kappa_e(\overline{M}_{g,n})$ is asymptotic…

We propose a new embedding method for a single vector and for a pair of vectors. This embedding method enables: a) efficient classification and regression of functions of single vectors; b) efficient approximation of distance functions; and…

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

In this paper we construct some invariants of spatial graphs by disk-summing the constituent knots and show the delta edge-homotopy invariance of them. As an application, we show that there exist infinitely many slice spatial embeddings of…

Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive biases, e.g., hierarchical structures benefit from hyperbolic…

It is proved that any smooth manifold $\mathcal M$ of dimension $m$ admits a smooth polynomially convex embedding into $\mathbb C^n$ when $n\geq \lfloor 5m/4\rfloor$. Further, such embeddings are dense in the space of smooth maps from…

In this paper, we study the set $\mathcal{S}^\kappa = \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^\kappa , j=1,\dots,n\}$, where $\kappa > 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…

Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…