Related papers: On the minimal teaching sets of two-dimensional th…
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…
The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…
The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however,…
We call a learner super-teachable if a teacher can trim down an iid training set while making the learner learn even better. We provide sharp super-teaching guarantees on two learners: the maximum likelihood estimator for the mean of a…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
Using commutative algebra methods we study the generalized minimum distance function (gmd function) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. The number of solutions that a…
Algorithmic machine teaching has been studied under the linear setting where exact teaching is possible. However, little is known for teaching nonlinear learners. Here, we establish the sample complexity of teaching, aka teaching dimension,…
We present an analytic way of writing simple crossing symmetric expressions and use them to search for unitary 4-point functions in 2D CFTs. We've applied our method for a class of functions we called generalized polynomials to achieve…
Elementary function calls are a common feature in numerical programs. While their implementions in library functions are highly optimized, their computation is nonetheless very expensive compared to plain arithmetic. Full accuracy is,…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
Polymer's network is treated as an anisotropic fractal with fractional dimensionality D = 1 + \epsilon close to one. Percolation model on such a fractal is studied. Using the real space renormalization group approach of Migdal and Kadanoff…
Considering the large number of fractional operators that exist, and since it does not seem that their number will stop increasing soon at the time of writing this paper, it is presented for the first time, as far as the authors know, a…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that…
We perform Monte Carlo simulations to determine the average excluded area $<A_{ex}>$ of randomly oriented squares, randomly oriented widthless sticks and aligned squares in two dimensions. We find significant differences between our results…
Generalizing our previous work on ``toroidal averages'', we study the average of special values of $L$-functions of the form $L(1/2,\chi^a)L(1/2,\chi^b)L(1/2,\chi^c)$ for integers $a$, $b$ and $c$, where $\chi$ varies over Dirichlet…
We discuss the global regularity for 2 dimensional minimal sets that are near a $\T$ set, that is, whether every global minimal set in $\R^n$ that looks like a $\T$ set at infinity is a $\T$ set or not. The main point is to use the…
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…
In the $(2,5)$ minimal model, the partition function for genus $g=2$ Riemann surfaces is given by a $5$-tuple of functions with appropriate transformation under the mapping class group. These functions generalise the two Rogers-Ramanujan…