Related papers: Rotational component spaces for infinite-type tran…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
This paper proposes a new factor rotation for the context of functional principal components analysis. This rotation seeks to re-represent a functional subspace in terms of directions of decreasing smoothness as represented by a generalized…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
We prove a recognition principle for motivic infinite P1-loop spaces over a perfect field. This is achieved by developing a theory of framed motivic spaces, which is a motivic analogue of the theory of E-infinity-spaces. A framed motivic…
Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
Given $\lambda\in\mathbb{R}$ and $\textbf{v}\in\mathbb{L}^3$, a $\lambda$-translator with velocity $\textbf{v}$ is an immersed surface in $\mathbb{L}^3$ whose mean curvature satisfies $H=\langle N,\textbf{v}\rangle+\lambda$, where $N$ is a…
We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…
Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
New elementary, self-contained proofs are presented for the topological and the smooth classification theorems of linear flows on finite-dimensional normed spaces. The arguments, and the examples that accompany them, highlight the…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We give an explicit description of the irreducible components of the moduli spaces of polarized Enriques surfaces in terms of decompositions of the polarization as an effective sum of isotropic classes. We prove that infinitely many of…
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We classify rotational surfaces in a normed 3-space with rotationally symmetric norm whose principal curvatures satisfy a linear relation.
We abstract and generalize homotopical monadicity statements, placing in a single conceptual framework a range of old and recent recognition and characterization principles in iterated loop space theory in classical, equivariant, and…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…