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

Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques…

Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently only combinatorial objects, however, many prominent analysis…

Inspired by long-standing open problems in algebraic combinatorics, we show that modern machine learning can meaningfully contribute to verifiable mathematical discoveries. In particular, we focus on the construction of simple mathematical…

In math.AC/9608214 it was shown that fields of generalized power series cannot admit an exponential function. In this paper, we construct fields of generalized power series with bounded support which admit an exponential. We give a natural…

The existence of decomposition solutions of the well-known nonlinear BKP hierarchy is explored. It is shown that these decompositions provide simple and interesting relationships between classical integrable systems and the BKP hierarchy.…

In this paper we define an internal binary operation between functions called in the text \emph{fractal convolution}, that applies a pair of mappings into a fractal function. This is done by means of a suitable Iterated Function System. We…

A doubling covering $\U$ of a complex $n$-dimensional manifold $Y$ consists of analytic functions $\psi_j:B_1\to Y$, each function being analytically extendable, as a mapping to $Y$, to a four times larger concentric ball $B_4$. Main result…

We define a new algebraic structure called a \emph{pointed rack} and use it to construct ambient isotopy invariants of $ n $-braids. We first introduce an integer-valued invariant of braids using pointed racks. This is then strengthened by…

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

Using neural networks to solve variational problems, and other scientific machine learning tasks, has been limited by a lack of consistency and an inability to exactly integrate expressions involving neural network architectures. We address…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

We introduce the concept of TRAP (Traces and Permutations), which can roughly be viewed as a wheeled PROP (Products and Permutations) without unit. TRAPs are equipped with a horizontal concatenation and partial trace maps. Continuous…

We consider the following dichotomy for $\Sigma^0_2$ finitary relations $R$ on analytic subsets of the generalized Baire space for $\kappa$: either all $R$-independent sets are of size at most $\kappa$, or there is a $\kappa$-perfect…

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a…

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

In this article we develop a new way of systematically constructing infinitely many families of smooth subvarieties $X$ of any given dimension $m$, $m \geq 3$, and any given codimension in $\mathbb P^N$, embedded by complete subcanonical…

Univariate polynomial root-finding is a classical subject, still 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…

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

Finding valid light paths that involve specular vertices in Monte Carlo rendering requires solving many non-linear, transcendental equations in high-dimensional space. Existing approaches heavily rely on Newton iterations in path space,…

Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$).…