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

Let $\kappa$ be an infinite cardinal. A topological space $X$ is $\kappa$-bounded if the closure of any subset of cardinality $\le\kappa$ in $X$ is compact. We discuss the problem of embeddability of topological spaces into Hausdorff…

For finite semidistributive lattices the map $\kappa$ gives a bijection between the sets of completely join-irreducible elements and completely meet-irreducible elements. Here we study the $\kappa$-map in the context of torsion classes. It…

In this article, we consider some generalizations of polynomial and exponential B-splines. Firstly, the extension from integral to complex orders is reviewed and presented. The second generalization involves the construction of uncountable…

We study a Lie algebra type $\kappa$-deformed space with undeformed rotation algebra and commutative vector-like Dirac derivatives in a covariant way. Space deformation depends on an arbitrary vector. Infinitely many covariant realizations…

We prove that for an arbitrary $\kappa \le \frac{1}{3}$ any subset of $\mathbf{F}_p$ avoiding $t$ linear equations with three variables has size less than $O(p/t^\kappa)$. We also find several applications to problems about so--called…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

A system of singular integral equations with monotone and concave nonlinearity in the subcritical case is investigated. The specified system and its scalar analog have direct applications in various areas of physics and biology. In…

Given two elementary embeddings from the collection of sets of rank less than $\lambda$ to itself, one can combine them to obtain another such embedding in two ways: by composition, and by applying one to (initial segments of) the other.…

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be…

Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…

We study Lie algebra $\kappa$-deformed Euclidean space with undeformed rotation algebra $SO_a(n)$ and commuting vectorlike derivatives. Infinitely many realizations in terms of commuting coordinates are constructed and a corresponding star…

We prove that for every uncountable cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, the quasi-order of embeddability on the $\kappa$-space of $\kappa$-sized graphs Borel reduces to the embeddability on the $\kappa$-space of…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

In this paper we use infinitary Turing machines with tapes of length $\kappa$ and which run for time $\kappa$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^{\kappa}$, where $\kappa$ is…

Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…

Let $j:V_\lambda---> V_\lambda$ be an elementary embedding, with critical point $\kappa$, and let $f(n)$ be the number of critical points of embeddings in the algebra generated by $j$ which lie between $j^n(\kappa)$ and $j^{n+1}(\kappa)$.…

This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…

An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…