Related papers: On the solutions of $\varphi(dn) = \varphi(d(n+h))…

Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

In this short note we derive, for bounded domains, an upper bound for a Friedrichs type constant in a weighted Friedrichs type inequality. This upper bound generalizes a well known upper bound of the Friedrichs constant. This upper bound is…

The aim of this short note is to provide a proof to a statement of Sierpi\'nski concerning the number of possible sums of a series (of type $\lambda<\aleph_1$) of arbitrary ordinal numbers.

We provide a generalization of a problem first considered by Saffari and fully solved by Saffari, Erd\H{o}s and Vaughan on direct factor pairs, to arbitrary finite families of direct factors, and solve it using a method of Daboussi. We end…

We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let \phi_H(n) denote the minimum number p such that any n-vertex G admits such a partition with at most p parts. We show that…

We propose a conjecture, similar to Skolem's conjecture, on a Hasse-type principle for exponential diophantine equations. We prove that in a sense the principle is valid for "almost all" equations. Based upon this we propose a general…

In this note we consider inequalities involving the error function $\phi$. Our methodes give new proofs of some known inequalities of Komatsu, and of Szarek and Werner, and also produce two families of inequalities that give upper and lower…

In this paper we prove a priori estimates for Donaldson's equation $\omega\wedge(\chi+\sqrt{-1}\partial\bar{\partial}\varphi)^{n-1}=e^{F}(\chi+\sqrt{-1}\partial\bar{\partial}\varphi)^{n}$ over a compact Hermitian manifold X of complex…

We formulate conjectures giving combinatorial interpretations of the Ehrhart $h^*$-vector, for hypersimplices, for dilated simplices and for generic cross-sections of cubes, in terms of certain decorated ordered set partitions. All were…

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

Recently we proposed an information entropy based method for electronic structure calculations within the density-matrix functional theory(DMFT) (Phys. Rev. Lett. 128, 013001), dubbed as $i$-DMFT. Comments have been raised regarding the…

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

We prove that no ball admits a non-harmonic orthogonal basis of exponentials. We use a combinatorial result, originally studied by Erd\H os, which says that the number of distances determined by $n$ points in ${\Bbb R}^d$ is at least $C_d…

We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…

Let $\Delta_k$ be the Dunkl Laplacian on $\mathbb R^d$ associated with a reflection group $W$ and a multiplicity function $k$. The purpose of this paper is to establish necessary and sufficient condition under which there exists a positive…

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…