Related papers: Density-1-bounding and quasiminimality in the gene…
In this paper, we generalized the Wijsman statistical convergence of closed sets in metric space by introducing the $f$-Wijsman statistical convergence these of sets, where $f$ is an unbounded modulus. It is shown that the Wijsman…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…
The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a…
In 1997 H.G.Diamond gave a condition on Beurling's generalized prime numbers in order that the corresponding generalized integers have a density. We give a new proof of this condition (Theorem 1) and a proof that it is not necessary…
We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…
Conditional density estimation is a general framework for solving various problems in machine learning. Among existing methods, non-parametric and/or kernel-based methods are often difficult to use on large datasets, while methods based on…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
We study generalized density-based clustering in which sharply defined clusters such as clusters on lower-dimensional manifolds are allowed. We show that accurate clustering is possible even in high dimensions. We propose two data-based…
Density matrices are the most general descriptions of quantum states, covering both pure and mixed states. Positive semidefiniteness is a physical requirement of density matrices, imposing nonnegative probabilities of measuring physical…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
We establish the density of the partial regularity result in the class of continuous viscosity solutions. Given a fully nonlinear equation, we prove the existence of a sequence entitled to the partial regularity result, approximating its…
We study typical wall singularity of codimension one for locally compact geodesically complete metric spaces with an upper curvature bound. We provide a geometric structure theorem of codimension one singularity, and a geometric…
This invited paper proposes and discusses several Bayesian attempts at nonparametric and semiparametric density estimation. The main categories of these ideas are as follows: 1) Build a nonparametric prior around a given parametric model.…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge (and any pair of crossing edges cross only once). A non-1-planar graph $G$ is minimal if the graph $G-e$ is 1-planar for every…
In this article we survey the development of generic and coarse computability and the main results on how classical asymptotic density interacts with the theory of computability.
We show, in a certain specific sense, that both the density and the cardinality of a Hausdorff space are related to the "degree" to which the space is nonregular. It was shown by Sapirovskii that $d(X)\leq\pi\chi(X)^{c(X)}$ for a regular…