Related papers: Critical points in an algebra of elementary embedd…

A parameter $c_0\in\mathbb C$ in the family of quadratic polynomials $f_c(z)=z^2+c$ is a critical point of a period $n$ multiplier, if the map $f_{c_0}$ has a periodic orbit of period $n$, whose multiplier, viewed as a locally analytic…

Let $\Omega$ be a smooth bounded simply connected domain in $\mathbb{R}^2$. We investigate the existence of critical points of the energy $E_\varepsilon (u)=1/2\int_\Omega |\nabla u|^2+1/(4\varepsilon^2)\int_\Omega (1-|u|^2)^2$, where the…

Jakobson and Nadirashvili \cite{JN} constructed a sequence of eigenfunctions on $T^2$ with a bounded number of critical points, answering in the negative the question raised by Yau \cite{Yau1} which asks that whether the number of the…

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

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…

Complex systems may morph between structures with different dimensionality and degrees of freedom. As a tool for their modelling, nonlinear embeddings are introduced that encompass objects with different dimensionality as a continuous…

We investigate large set axioms defined in terms of elementary embeddings over constructive set theories, focusing on $\mathsf{IKP}$ and $\mathsf{CZF}$. Most previously studied large set axioms, notably the constructive analogues of large…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

We consider a special case of the n-component cubic model on the square lattice, for which an expansion exists in Ising-like graphs. We construct a transfer matrix and perform a finite-size-scaling analysis to determine the critical points…

For any $q\in\mathbb{R}$, let $A:=\left(\begin{smallmatrix}1 & 1\\0 & 1\end{smallmatrix}\right), B_q:=\left(\begin{smallmatrix}1 & 0\\q & 1\end{smallmatrix}\right)$ and let $G_q:=\langle…

We prove that any finitely generated elementary amenable group of zero (algebraic) entropy contains a nilpotent subgroup of finite index or, equivalently, any finitely generated elementary amenable group of exponential growth is of…

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…

The {\em abeliant} is a polynomial rule for producing an $n$ by $n$ matrix with entries in a given ring from an $n$ by $n$ by $n+2$ array of elements of that ring. The theory of abeliants, first introduced in an earlier paper of the author,…

Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for…

A general, {\em rectangular} kernel matrix may be defined as $K_{ij} = \kappa(x_i,y_j)$ where $\kappa(x,y)$ is a kernel function and where $X=\{x_i\}_{i=1}^m$ and $Y=\{y_i\}_{i=1}^n$ are two sets of points. In this paper, we seek a low-rank…

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

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…

We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…

An important problem in combinatorial noncommutative algebra is to characterize the growth functions of finitely generated algebras (equivalently, semigroups, or hereditary languages). The growth function of every finitely generated,…