Related papers: An approximation principle for congruence subgroup…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
We present a new neural network to approximate convex functions. This network has the particularity to approximate the function with cuts and can be easily adapted to partial convexity. We give an universal approximation theorem in the full…
The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…
Given a bounded-above cochain complex of modules over a ring, it is standard to replace it by a projective resolution, and it is classical that doing so can be very useful. Recently, a modified version of this was introduced in triangulated…
In the first part, in the local non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We conjecture that such distributions are invariant by transposition. This would imply…
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the…
The concept of approximation gain was introduced recently by M\"uller and Taktikos for some abc-triples related to convergents of surds, where there is a relatively large gap between min{a,b,c} and max{a,b,c}. This note proposes a…
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
Jaberi [7] presented approximation algorithms for the problem of computing a minimum size 2-vertex strongly biconnected subgraph in directed graphs. We have implemented approximation algorithms presented in [7] and we have tested the…
For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…
Constrained forest problems form a class of graph problems where specific connectivity requirements for certain cuts within the graph must be satisfied by selecting the minimum-cost set of edges. The prize-collecting version of these…
We provide a new general theorem for multivariate normal approximation on convex sets. The theorem is formulated in terms of a multivariate extension of Stein couplings. We apply the results to a homogeneity test in dense random graphs and…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
In this sequel to arXiv1407.4089 by the second author, we extend to multi-dimensional (or infinite-dimensional) settings the Goldie equation arising in the general regular variation of `General regular variation, Popa groups and quantifier…
We develop practical techniques to compute with arithmetic groups $H\leq \mathrm{SL}(n,\mathbb{Q})$ for $n>2$. Our approach relies on constructing a principal congruence subgroup in $H$. Problems solved include testing membership in $H$,…
We consider the problem of learning from a similarity matrix (such as spectral clustering and lowd imensional embedding), when computing pairwise similarities are costly, and only a limited number of entries can be observed. We provide a…
We establish an equality between two multiplicities: one in the restriction of tempered representations of a $p$-adic group to its closed subgroup with the same derived group; and one occurring in their corresponding component groups in…