Related papers: On almost Cap sets in three variables and the mult…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…

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,…

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

In our previous paper [9], we have introduced topological nearly entropy, Ent_N (f) by restricting X into a class of nearly compact spaces. In the present paper, some additional properties of this notion are studied. Furthermore, we…

Every finite non-abelian group of order $n$ has a non-central element whose centralizer has order exceeding $n^{1/3}$. The proof does not rely on the classification of finite simple groups, yet it uses the Feit-Thompson theorem.

We show that for all finite fields F_q, there exists a curve C over F_q of genus 3 such that the number of rational points on C is within 3 of the Serre-Weil upper or lower bound. For some q, we also obtain improvements on the upper bound…

Some new families of small complete caps in $PG(N,q)$, $q$ even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem…

Several recent papers have considered the Ramsey-theoretic problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to number fields, determining…

Let $\mathcal A$ be a separable, unital, approximately divisible C$^*$-algebra. We show that $\mathcal A$ is generated by two self-adjoint elements and the topological free entropy dimension of any finite generating set of $\mathcal A$ is…

This text collects useful results concerning the quasi-Hopf algebra $\D $. We give a review of issues related to its use in conformal theories and physical mathematics. Existence of such algebras based on 3-cocycles with values in $ {R} /…

In the setting of a metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we show that the total variation of functions of bounded variation is lower semicontinuous with respect to $L^1$-convergence in…

Let $\alpha_1, \ldots, \alpha_m$ be two or more positive reals with sum $1$, let $C\subseteq \mathbb{R}^k$ be an open convex set, and $f: C\to \mathbb{R}^k$ be a continuous injection with convex image. For each nonempty set $S\subseteq C$,…

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

Factor graph of an instance of a constraint satisfaction problem with n variables and m constraints is the bipartite graph between [m] and [n] describing which variable appears in which constraints. Thus, an instance of a CSP is completely…

A finite set of points in $\mathbb R^d$ is called almost-equidistant if among any three distinct points in the set, some two are at unit distance. We prove that an almost-equidistant set in $\mathbb R^d$ has cardinality at most $5d^{13/9}$.

We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…