Related papers: An approximation principle for congruence subgroup…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
We introduce a proximal version of dual coordinate ascent method. We demonstrate how the derived algorithmic framework can be used for numerous regularized loss minimization problems, including $\ell_1$ regularization and structured output…
The Augmented Lagrangian Method as an approach for regularizing inverse problems received much attention recently, e.g. under the name Bregman iteration in imaging. This work shows convergence (rates) for this method when Morozov's…
In a previous paper, we studied certain sequences of simultaneous rational approximations in ${\bf R}^2$ which present some analogy with the continued fractions. We got results around the Littlewood conjecture by using such approximations.…
We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore,…
The article deals with the issue of modification of metric classification algorithms. In particular, it studies the algorithm k-Nearest Neighbours for its application to sequential data. A method of generalization of metric classification…
An estimate of the order of approximation in the central limit theorem for strictly stationary associated random variables with finite moments of order q > 2 is obtained. A moderate deviation result is also obtained. We have a refinement of…
Seriation seeks to reconstruct a linear order between variables using unsorted, pairwise similarity information. It has direct applications in archeology and shotgun gene sequencing for example. We write seriation as an optimization problem…
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
In this paper we study the convergence in distribution and the local limit theorem for the partial sums of linear random fields with i.i.d. innovations that have infinite second moment and belong to the domain of attraction of a stable law…
We prove the boundedness of complements modulo two conjectures: Borisov-Alexeev conjecture and effective adjunction for fibre spaces. We discuss the last conjecture and prove it in two particular cases.
We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second…
We consider the restriction and induction of representations between a covering group and its derived subgroup, both on the representation-theoretic side and the L-parameter side. In particular, restriction of a genuine principal series is…
An often-cited fact regarding mixing or mixture distributions is that their density functions are able to approximate the density function of any unknown distribution to arbitrary degrees of accuracy, provided that the mixing or mixture…
We study loop near-rings, a generalization of near-rings, where the additive structure is not necessarily associative. We introduce local loop near-rings and prove a useful detection principle for localness.
In this sequel to arXiv:0905.3327, we continue to study the congruence properties of the alternating version of multiple harmonic sums. As contrast to the study of multiple harmonic sums where Bernoulli numbers and Bernoulli polynomials…
In this paper, we will present several new congruences involving binomial coefficients under integer moduli, which are the continuation of the previous two work by Cai \textit{et al.} (2002, 2007).
This paper gives the additivity and reduction formulas for mixed multiplicities of multi-graded modules $M$ and mixed multiplicities of arbitrary ideals, and establishes the recursion formulas for the sum of all the mixed multiplicities of…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.