Related papers: Almost $\mathcal{R}$-trivial monoids are almost ne…

This is the second in a series of papers that develops the theory of reflection monoids, motivated by the theory of reflection groups. Reflection monoids were first introduced in arXiv:0812.2789. In this paper we study their presentations…

We consider a generalization of Riemannian geometry that naturally arises in the framework of control theory. Let $X$ and $Y$ be two smooth vector fields on a two-dimensional manifold $M$. If $X$ and $Y$ are everywhere linearly independent,…

This paper is the first part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a…

This paper establishes the argmin of a random objective function to be unique almost surely. This paper first formulates a general result that proves almost sure uniqueness without convexity of the objective function. The general result is…

\"Ostlund (2001) showed that all planar isotopy invariants of generic plane curves that are unchanged under cusp moves and triple point moves, and of finite degree (in self-tangency moves) are trivial. Here the term "of finite degree" means…

Reverse Mathematics (RM for short) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the…

A graph $H$ is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of $H$ contained in any $2$-edge-coloring of $K_n$, is asymptotically the same as the number of monochromatic copies in the random…

Let R be a regular local ring, containing a finite field. Let G be a reductive group scheme over R. We prove that a principal G-bundle over R is trivial, if it is trivial over the fraction field of R. In other words, if K is the fraction…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and Halter-Koch's 2006 monograph on the subject, to a non-commutative and non-cancellative setting, in the same spirit of…

The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the…

In [3] (Rend. Lincei Mat. Appl. 26 (2015), 1-10; see also arXiv:1503.08145 [math.DS]) the following result has been announced: Theorem. Consider a real-analytic nearly-integrable mechanical system with potential $f$, namely, a Hamiltonian…

We study a new class of functions that arise naturally in quaternionic analysis, we call them "quasi regular functions". Like the well-known quaternionic regular functions, these functions provide representations of the quaternionic…

Let $V$ be a smooth cubic surface over a $p$-adic field $k$ with good reduction. Swinnerton-Dyer (1981) proved that $R$-equivalence is trivial on $V(k)$ except perhaps if $V$ is one of three special types--those whose $R$-equivalence he…

Often regarded as the study of how order emerges from randomness, Ramsey theory has played an important role in mathematics and computer science, giving rise to applications in numerous domains such as logic, parallel processing, and number…

We clarify quasi-Frobenius configurations of finite Morley rank. 1. We remove one assumption in an identification theorem by Zamour while simplifying the proof. 2. We show that a strongly embedded quasi-Frobenius configuration of odd type,…

Finite-dimensional Reedy algebras form a ring-theoretic analogue of Reedy categories and were recently proved to be quasi-hereditary. We identify Reedy algebras with quasi-hereditary algebras admitting a triangular (or…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric…