Related papers: Coarse-grained integers - Smooth? Rough? Both!

Kronecker-factored Approximate Curvature (K-FAC) method is a high efficiency second order optimizer for the deep learning. Its training time is less than SGD(or other first-order method) with same accuracy in many large-scale problems. The…

We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

Using concepts from integral geometry, we propose a definition for a local coarse-grained curvature tensor that is well-defined on polygonal surfaces. This coarse-grained curvature tensor shows fast convergence to the curvature tensor of…

A robust estimator, namely M-smoother, for piecewise-constant smoothing is revisited in this paper. Starting from its generalized formulation, we propose a numerical scheme/framework for solving it via a series of weighted-average filtering…

The article is devoted to the investigation of smoothness of functions $f(x_1,...,x_m)$ of variables $x_1,...,x_m$ in infinite fields with non-trivial multiplicative ultra-norms, where $m\ge 2$. Theorems about classes of smoothness $C^n$ or…

In this paper, we will present a new iterative construction for the auxiliary equation of Waring's problem, which seems a little simpler than the one of so called "smooth numbers" in papers [4] and [8], and give same upper bounds of G(k) as…

Let $C$ be a regular geometrically integral curve over an imperfect field $K$ and assume that it admits a non-smooth point $\mathfrak{p}$ which -- seen as a prime of the separable function field $K(C)|K$ -- is non-decomposed in the base…

We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for…

We study the problem #IndSub(P) of counting all induced subgraphs of size k in a graph G that satisfy the property P. This problem was introduced by Jerrum and Meeks and shown to be #W[1]-hard when parameterized by k for some families of…

In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…

The main goal of this paper is to give a general method to compute (via computer algebra systems) an explicit set of generators of the ideals of the projective embeddings of some ruled surfaces, namely projective line bundles over curves…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

We further analyse,at next-to-leading log(s) level,the form of k-factorization and the definition of impact factors previously proposed by one of us,and we generalize them to the case of hard colourless probes. We then calculate the finite…

In this paper, we develop a quantitative K-theory for filtered C*-algebras. Particularly interesting examples of filtered C*-algebras include group C*-algebras, crossed product C*-algebras and Roe algebras. We prove a quantitative version…

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…

Let $\psi_{\mathbb K}$ be the Chebyshev function of a number field $\mathbb K$. Let $\psi^{(1)}_{\mathbb K}(x):=\int_{0}^{x}\psi_{\mathbb K}(t)\,d t$ and $\psi^{(2)}_{\mathbb K}(x):=2\int_{0}^{x}\psi^{(1)}_{\mathbb K}(t)\,d t$. We prove…

We first define the coarse-graining of probability measures in terms of stochastic kernels. We define when a probability measure is part of another probability measure and say that two probability measures coexist if they are both parts of…