Related papers: Demailly's Conjecture for general and very general…

This paper discovers a new phenomenon about the Duffin-Schaeffer conjecture, which claims that $\lambda(\cap_{m=1}^{\infty}\cup_{n=m}^{\infty}{\mathcal E}_n)=1$ if and only if $\sum_n\lambda({\mathcal E}_n)=\infty$, where $\lambda$ denotes…

We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

The main result is a direct proof of the implication $(LVKF_{k,3})\Rightarrow( LT_{3k-1,3})$ below. Consider the following statements: ($LVKF_{1,3}$) From any 11 points in $ \mathbb{R}^{3}$ one can choose 3 pairwise disjoint triples whose…

We prove that if \Gamma is subgroup of Diff_{+}^{1+\epsilon}(I) and N is a natural number such that every non-identity element of \Gamma has at most N fixed points then \Gamma is solvable. If in addition \Gamma is a subgroup of…

We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.

The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…

Given an eigenvalue $\lambda$ of the Laplace-Beltrami operator on $n-$spheres or $-$hemispheres, with multiplicity $m$ such that $\lambda=\lambda_{k}=\dots = \lambda_{k+m-1}$, we characterise the lowest and highest orders in the set…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…

We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…

We use Janson's dependency criterion to prove that the distribution of $d$-descents of permutations of length $n$ converge to a normal distribution as $n$ goes to infinity. We show that this remains true even if $d$ is allowed to grow with…

In the present article, we obtain an estimation of the weighted $L^2$ norm near the singularities of plurisubharmonic weight related to Demailly's strong openness conjecture, which implies the convergence of the weighted $L^2$ norm.

A classical inequality due to Bohnenblust and Hille states that for every positive integer $m$ there is a constant $C_{m}>0$ so that $$(\sum\limits_{i_{1},...,i_{m}=1}^{N}|U(e_{i_{^{1}}},...,e_{i_{m}})| ^{\frac{2m}{m+1}})…

The multi-point Taylor polynomial, which is the general, unique and of minimum degree ($mk+m-1$) polynomial $P_{k,m}(x)$ which interpolates a function's derivatives in multiple points is presented in its explicit form. A proof that this…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

We consider the following question. Suppose that $d\ge2$ and $n$ are fixed, and that $\theta_1,\theta_2,\dots,\theta_n$ are $n$ specified angles. How many points do we need to place in $\mathbb{R}^d$ to realise all of these angles? A simple…

Let $\varepsilon\in(0,1)$ and $X\subset\mathbb R^d$ be arbitrary with $|X|$ having size $n>1$. The Johnson-Lindenstrauss lemma states there exists $f:X\rightarrow\mathbb R^m$ with $m = O(\varepsilon^{-2}\log n)$ such that $$ \forall x\in X\…