Related papers: Expressing the cone radius in the relational calcu…

We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.

In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…

We study the proportion of conics given by $(\mathcal{C}_{\mathbf{F}, \mathbf{y}}) : F_0(\mathbf{y})x_0^2 + F_1(\mathbf{y})x_1^2 = F_2( \mathbf{y})x_2^2 $ which have a rational point $\mathbf{x} = (x_0 :x_1:x_2) \in…

We give two elementary proofs, at a level understandable by students with only pre-calculus knowledge of Algebra, of the well known fact that an irreducible irrational n-th root of a positive rational number cannot be solution of a…

A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a…

We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…

We introduce a new approach to the study of a system of algebraic equations in the algebraic torus whose Newton polytopes have sufficiently general relative positions. Our method is based on the theory of Parshin's residues and tame symbols…

We introduce the notion of pseudo-cones of metric spaces as a generalization of both of the tangent cones and the asymptotic cones. We prove that the Assouad dimension of a metric space is bounded from below by that of any pseudo-cone of…

Every polyhedral cone can be described either by its facets or by its extreme rays. Computation of one description from the other is a problem that can be very complex, i.e. one encounter the combinatorial explosion. We present here several…

We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…

A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies…

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…

We construct new relativistic linear differential equation in $d$ dimensions generalizing Dirac equation by employing the Clifford algebra of the cubic polynomial associated to Klein-Gordon operator multiplied by the mass parameter. Unlike…

We generalize to any q a theorem about covering radius of linear codes proved by Helleseth, Klove and Mykkelvit. Then we determine the covering radius of first order generalized Reed-Muller codes in second order generalized Reed-Muller…