Related papers: Comment to "Almost disjoint sets, the dense set pr…

We correct a small gap found in the authors' paper 'On bounds for the effective differential Nullstellensatz' (J Algebra 449:1-21, 2016). This gap is due to an inequality that does not generally hold. However, under one additional…

We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

In this note, we present a substantial improvement on the computational complexity of the Erd\"{o}s-Szekeres partitioning problem and review recent works on dynamic \textsf{LIS}.

This work is a follow-up to our previous work "A numerical approach related to defect-type theories for some weakly random problems in homogenization" (preprint available on this archive). It extends and complements, both theoretically and…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

This text is a somewhat reformatted (e.g., some statements that were not as such in the original paper, are given the names "Corollary" or "Theorem.") translation of the old and practically inaccessible paper: P. Kuchment, On the question…

The paper contains critical comments to the paper mentioned in the title from the mathematical point of view

We prove some weighted refined decoupling estimates. As an application, we give an alternative proof of the following result on Falconer's distance set problem by the authors in a companion work: if a compact set $E\subset \mathbb{R}^d$ has…

In this short note, it is shown that there is a gap in the proof of Theorem 11 in the paper of Meyer and Neutsch (J. of Algebra, 1993). We prove, nevertheless, that the statement of the theorem is true and fix the proof by using a certain…

In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…

This note serves to provide additional details for the proof of Lemma 3.6 in our paper [Liu, Zhang and Zhang, Comm. Math. Sci., 3(2005), pp.201-218]. Moreover, we will also present an alternative, yet simpler, proof based on arguments in…

Let $G$ be an additive group of order $v$. A $k$-element subset $D$ of $G$ is called a $(v, k, \lambda, t)$-almost difference set if the expressions $gh^{-1}$, for $g$ and $h$ in $D$, represent $t$ of the non-identity elements in $G$…

This is an introduction to small divisors problems. The material treated in this book was brought together for a PhD course I tought at the University of Pisa in the spring of 1999. Here is a Table of Contents: Part I One Dimensional Small…

These supplementary notes in the ArXiv are a companion to our paper "Bocher contractions of conformally superintegrable Laplace equations" [arXiv:1512.09315]. They contain background material and the details of the extensive computations…

By using the approach in \cite{XX2006} to Hall algebras arising in homologically finite triangulated categories, we find an `almost' associative multiplication structure for indecomposable objects in a 2-periodic triangulated category. As…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…