Related papers: An approximation principle for congruence subgroup…
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
We prove some new results which justify the use of interval truncation as a means of regularising a singular fourth order Sturm-Liouville problem near a singular endpoint. Of particular interest are the results in the so called lim-3 case,…
Continuing the study reported in Satheesh (2001),(math.PR/0304499 dated 01 May 2003) and Satheesh (2002)(math.PR/0305030 dated 02May 2003), here we study generalizations of infinitely divisible (ID) and max-infinitely divisible (MID) laws.…
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This is an attempt at applied mathematics, a sequel to arXiv:math/0306174. It suggests a particular model for the application in question, based on the binary octahedral group.
The main aim of this paper is to further develop the multiple-correction method that formulated in our previous works~\cite{CXY, Cao}. As its applications, we establish a kind of hybrid-type finite continued fraction approximations related…
We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…
In this paper we consider the notions of binomial thinning, binomial mixing, their generalizations, certain interplay between them, associated limit theorems and provide various examples.
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…
Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsification, submodular hypergraph sparsification, general notions…
This paper deals with study of the sufficient condition of approximation raring process with mixing by renewall process. We consider use the proved results to practice problem too
We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…
We survey current developments in the approximation theory of sequence modelling in machine learning. Particular emphasis is placed on classifying existing results for various model architectures through the lens of classical approximation…
In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…
In this note, we generalize an ancient Greek inequality about the sequence of primes to the cases of arithmetic progressions even multivariable polynomials with integral coefficients. We also refine Bouniakowsky's conjecture [16] and…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…
This chapter surveys recent and less recent results on convergence of Kleinian representations, following Thurston's Double Limit and "AH(acylindrical) is compact" Theorems.
This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.
We prove that the isomorphism problem for group algebras reduces to group algebras over finite extensions of the prime field. In particular, the modular isomorphism problem reduces to finite modular group algebras.