Related papers: A new minimal non-$\sigma$-scattered linear order
Using an invariant modification of Jensen's "minimal $\varPi^1_2$ singleton" forcing, we define a model of ZFC, in which, for a given $n\ge2$, there exists a lightface $\varPi^1_n$ unordered pair of non-OD (hence, OD-indiscernible)…
We construct examples of non-bi-orderable one-relator groups without generalized torsion. This answers a question asked in [2].
Non-linear least squares solvers are used across a broad range of offline and real-time model fitting problems. Most improvements of the basic Gauss-Newton algorithm tackle convergence guarantees or leverage the sparsity of the underlying…
We study a class of noncommutative surfaces and their higher dimensional analogues which provide answers to several open questions in noncommutative projective geometry. Specifically, we give the first known graded algebras which are…
Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient…
We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems over discretely ordered rings. Also for a discretely ordered…
Randomized iterative algorithms have recently been proposed to solve large-scale linear systems. In this paper, we present a simple randomized extended block Kaczmarz algorithm that exponentially converges in the mean square to the unique…
We prove a statement of Ax-Lindemann type for the uniformization of products of Mumford curves whose associated fundamental groups are non-abelian Schottky subgroups of $\mathop{\rm PGL}(2,\bar{\mathbf Q_p})$ contained in $\mathop{\rm…
In this paper, we obtain respectively some new linear bases of free unitary (modified) weighted differential algebras and free nonunitary (modified) Rota-Baxter algebras, in terms of the method of Gr\"{o}bner-Shirshov bases.
For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains…
In this paper we study the central limit theorem and its functional form for random fields which are not started from their equilibrium, but rather under the measure conditioned by the past sigma field. The initial class considered is that…
Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are…
In this paper some qualitative and geometric aspects of nonsmooth vector fields theory are discussed. In the class of nonsmooth systems, that do not present sliding regions, a Poincar\'e-Bendixson Theorem is presented. A minimal set in…
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
In applications, a substantial number of problems can be formulated as non-linear least squares problems over smooth varieties. Unlike the usual least squares problem over a Euclidean space, the non-linear least squares problem over a…
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of…
The ordered allocation sampler is a Gibbs sampler designed to explore the posterior distribution in nonparametric mixture models. It encompasses both infinite mixtures and finite mixtures with random number of components, and it has be…
The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…