Related papers: Extraction Theorems With Small Extraction Numbers
We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…
We propose axioms for 0-dimensional ideal approximation theory and note that extriangulated categories satisfy these axioms.
Artificial objects usually have very stable shape features, which are stable, persistent properties in geometry. They can provide evidence for object recognition. Shape features are more stable and more distinguishing than appearance…
A theorem on subwavelength imaging with arrays of discrete sources is formulated. This theorem is analogous to the Kotelnikov (also named Nyquist-Shannon) sampling theorem as it represents the field at an arbitrary point of space in terms…
This paper is based on a previous publication [29]. Our work extends exception mining and outlier detection to the case of object-relational data. Object-relational data represent a complex heterogeneous network [12], which comprises…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
The combination of words ``discrete curvature'' is only an apparent contradiction. In this survey we describe curvature notions associated with polygons, polyhedral surfaces, and with abstract polyhedral manifolds. Several theorems about…
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…
Using estimates on Hooley's $\Delta$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
In this paper we develop the obstruction theory for lifting complexes, up to quasi-isomorphism, to derived categories of flat nilpotent deformations of abelian categories. As a particular case we also obtain the corresponding obstruction…
We prove an analogue of the Prime Number Theorem for short intervals on a smooth projective geometrically irreducible curve of arbitrary genus over a finite field. A short interval "of size E" in this setting is any additive translate of…
Outliers widely occur in big-data applications and may severely affect statistical estimation and inference. In this paper, a framework of outlier-resistant estimation is introduced to robustify an arbitrarily given loss function. It has a…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
Two broad classes of graphical modeling problems for codes can be identified in the literature: constructive and extractive problems. The former class of problems concern the construction of a graphical model in order to define a new code.…
In this paper we propose a wide class of truncated stochastic approximation procedures with moving random bounds. While we believe that the proposed class of procedures will find its way to a wider range of applications, the main motivation…
We identify a class of operator pencils, arising in a number of applications, which have only real eigenvalues. In the one-dimensional case we prove a novel version of the Sturm oscillation theorem: if the dependence on the eigenvalue…
Standard Model extensions often predict low-mass and very weakly interacting particles, such as the axion. A number of small-scale experiments at the intensity/precision frontier are actively searching for these elusive particles,…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…