Related papers: On the minimal teaching sets of two-dimensional th…

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of…

We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…

We classify completely the surfaces of general type whose canonical map is 3-to-1 onto a surface of minimal degree in projective space. These surfaces fall into 5 distinct classes and we give explicit examples belonging to each of these…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Let T be Takagi's continuous but nowhere-differentiable function. It is known that almost all level sets (with respect to Lebesgue measure on the range of T) are finite. We show that the most common cardinality of the level sets of T is…

We provide an estimate for the number of nontrivial integer points on the Pellian surface $t^2 - du^2 = 1$ in a bounded region. We give a lower bound on the size of fundamental solutions for almost all $d$ in a certain class, based on a…

Let $S$ be a minimal surface of general type with $p_g(S)=2$ and $K^2_S=1$, so called by a minimal $(1,2)$-surface. Then we obtain that the global log canonical threshold of the surface $S$ via $K_S$ is greater than equal to $\frac{1}{2}$.…

The paper search for the minimum of the entropy of a two- dimensional distribution in the Fr\'echet class, the class of distributions with given marginals. The main result for discrete distributions is an algorithm for building the…

We construct two minimal Cheeger sets in the Euclidean plane, i.e. unique minimizers of the ratio "perimeter over area" among their own measurable subsets. The first one gives a counterexample to the so-called weak regularity property of…

The general properties of two-dimensional generalized Bessel functions are discussed. Various asymptotic approximations are derived and applied to analyze the basic structure of the two-dimensional Bessel functions as well as their nodal…

We give simple expressions for the mean of the max and min bounds of the critical-to-classical crossover functions previously calculated [Bagnuls and Bervillier, Phys. Rev. E 65, 066132 (2002)] within the massive renormalization scheme of…

Teaching dimension is a learning theoretic quantity that specifies the minimum training set size to teach a target model to a learner. Previous studies on teaching dimension focused on version-space learners which maintain all hypotheses…

We establish the existence and uniqueness of rational conformal maps of minimal degree $n+1$ for opening up $n$ arcs. In earlier results, the degree was exponential in $n$. We also discuss two related problems. (a) We establish existence of…

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

We characterize minimal clones generated by a majority function containing at most seven ternary operations.

This paper investigates the theoretical foundations of metric learning, focused on three key questions that are not fully addressed in prior work: 1) we consider learning general low-dimensional (low-rank) metrics as well as sparse metrics;…

We show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.

A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…

In this paper, we study the differential inclusion associated to the minimal surface system for two-dimensional graphs in $\mathbb{R}^{2 + n}$. We prove regularity of $W^{1,2}$ solutions and a compactness result for approximate solutions of…