Related papers: Simplifying the axiomatization for the order affin…

A PhD thesis written under supervision of Pawel Nurowski and defended at the Faculty of Physics of the University of Warsaw. We adress the problems of local equivalence and geometry of third order ODEs modulo contact, point and…

Absolute parallelism (AP) geometry is frequently used for physical applications. Although it is wider than Riemannian geometry, it has two main defects. The first is that its path equation does not represent physical trajectories of any…

In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…

We lift the classical theorem of Arnol'd on homological stability for configurations spaces of the plane to the motivic world. More precisely, we prove that the schemes of unordered configurations of points in the affine line satisfy…

We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…

For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand,…

Finite element codes typically use data structures that represent unstructured meshes as collections of cells, faces, and edges, each of which require associated coordinate systems. One then needs to store how the coordinate system of each…

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

In this article, as a new mathematical approach to origin of the basic laws of nature, using a new algebra-axiomatic matrix formalism based on the ring theory and Clifford algebras , "it is shown that certain mathematical forms of…

It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…

Over the past decade, the class of Oka manifolds has emerged from Gromov's seminal work on the Oka principle. Roughly speaking, Oka manifolds are complex manifolds that are the target of "many" holomorphic maps from affine spaces. They are…

In this paper, we extend the notion of orthogonality to the general elements of an absolute matrix order unit space and relate it to the orthogonality among positive elements. We introduce the notion of a partial isometry in an absolute…

A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…

Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…

We study congruences of lines $X_\omega$ defined by a sufficiently general choice of an alternating 3-form $\omega$ in $n+1$ dimensions, as Fano manifolds of index $3$ and dimension $n-1$. These congruences include the…

We consider the analogue for regular maps from affine varieties to suitable algebraic manifolds of Oka theory for holomorphic maps from Stein spaces to suitable complex manifolds. The goal is to understand when the obstructions to…

Cohomology of affinoids does not behave well; often, this can be remedied by making affinoids overconvergent. In this paper, we focus on dimension 1 and compute, using analogs of pants decompositions of Riemann surfaces, various…

Two-view relative pose estimation and structure reconstruction is a classical problem in computer vision. The typical methods usually employ the singular value decomposition of the essential matrix to get multiple solutions of the relative…

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…