Related papers: Comment to "Almost disjoint sets, the dense set pr…
Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…
We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…
In this article, we investigate the orthonormal Strichartz estimates and the convergence problem of the density function associated with $\partial_{x}^{3}+\partial_{x}^{-1}$. Firstly, when $\gamma_{0}\in\mathfrak{S}^{\beta}(\dot{H}^{s})$…
Translation of 'Die Logik Nicht Gleichzeitig Entscheidbarer Aussagen' by Ernst Specker, Dialectica, vol. 14, 239 - 246 (1960).
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
This short note completes the symmetry analysis of a class of quasi-linear partial differential equations considered in the previous paper (Nonlinear Dynamics, Vol. 51, 309-316 (2008)): it deals with the presence of an "exceptional" Lie…
It is a correction paper on "P.J. Wan and C.W. Yi, "Coverage by Randomly Deployed Wireless Sensor Networks", IEEE Transaction On Information Theory, vol.52, No.6, June 2006." In the above paper, Lemma (4), on page 2659 play the key role for…
Let W: R to (0,1] be continuous. Bernstein's approximation problem, posed in 1924, deals with approximation by polynomials in the weighted uniform norm ||fW|| Linfinity(R) . The qualitative form of this problem was solved by Achieser,…
We have defined almost separable space. We show that like separability, almost separability is $c$ productive and converse also true under some restrictions. We establish a Baire Category theorem like result in Hausdorff, Pseudocompacts…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
In an earlier paper (joint with Min Ru), we proved a result on diophantine approximation to Cartier divisors, extending a 2011 result of P. Autissier. This was recently extended to certain closed subschemes (in place of divisors) by Ru and…
This is an updated version of the lectures notes for a course on condensed mathematics taught in the summer term 2019 at the University of Bonn. The material presented is joint work with Dustin Clausen. This is intended as a stable citable…
This note addresses the continuum problem, taking advantage of the breakthrough mentioned in the subtitle, and relating it to many recent advances occurring in set theory.
A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…
This paper provides fascinating connections between several mathematical problems which lie on the intersection of several mathematics subjects, namely algebraic geometry, approximation theory, complex-harmonic analysis and high dimensional…
$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…
In this note we prove that almost cap sets $A \subset \mathbb{F}_q^n$, i.e., the subsets of $\mathbb{F}_q^n$ that do not contain too many arithmetic progressions of length three, satisfy that $|A| < c_q^n$ for some $c_q < q$. As a corollary…
We give a counterexample to Theorem 9 in [T.K. Subrahmonian Moothathu, Syndetically proximal pairs, J. Math. Anal. Appl. 379 (2011) 656--663]. We also provide sufficient conditions for the conclusion of Theorem 9 to hold.
Bernstein-von Mises results (BvM) establish that the Laplace approximation is asymptotically correct in the large-data limit. However, these results are inappropriate for computational purposes since they only hold over most, and not all,…
We generalize Bj\"{o}rner and Stanley's poset of compositions to $m$-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric…