相关论文: Effective Lower Bounds for L(1,{\chi}) via Eisenst…

We consider a variational problem modeling transition between flat and wrinkled region in a thin elastic sheet, and identify the $\Gamma$-limit as the sheet thickness goes to 0, thus extending the previous work of the first author [Bella,…

The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for…

Our aim of this article is to reconstruct a signal from undersampled data in the situation that the signal is sparse in terms of a tight frame. We present a condition, which is independent of the coherence of the tight frame, to guarantee…

We derive explicit bounds for two general classes of $L$-functions, improving and generalizing earlier known estimates. These bounds can be used, for example, to apply Turing's method for determining the number of zeros up to a given…

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

In our recent work \cite{StojnicCSetam09} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved that if the number of equations in the system is…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach…

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…

We explicitly write down the Eisenstein elements inside the space of modular symbols for Eisenstein series with integer coefficients for the congruence subgroups $\Gamma_0(N)$ with $N$ odd square-free. We also compute the winding elements…

We prove a quantitative lower bound on the number of nodal domains of the real-analytic Eisenstein series. The main tool in the proof is a quantitative restricted QUE theorem where the support of the test function is allowed to shrink with…

We derive strong and effective lower bounds for the class number h(q) of the imaginary quadratic field Q(\sqrt{-q}), conditionally subject to the existence of many small (subnormal) gaps between zeros of the L-function associated with a…

The iteratively reweighted least squares method (IRLS) is a popular technique used in practice for solving regression problems. Various versions of this method have been proposed, but their theoretical analyses failed to capture the good…

We obtain new invariant Einstein metrics on the compact Lie groups $SO(n)$ ($n \geq 7$) which are not naturally reductive. This is achieved by imposing certain symmetry assumptions in the set of all left-invariant metrics on $SO(n)$ and by…

This paper establishes power-saving bounds for Kloosterman sums associated with the long Weyl element for GL(n), as well as for another type of Weyl element of order 2. These bounds are obtained by establishing an explicit representation as…

In the present paper we prove lower bounds for L-functions from the Selberg class, by this means improving earlier results obtained by the second author together with J\"orn Steuding. We formulate two theorems which use slightly different…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We present an iterative support shrinking algorithm for $\ell_{p}$-$\ell_{q}$ minimization~($0 <p < 1 \leq q < \infty $). This algorithm guarantees the nonexpensiveness of the signal support set and can be easily implemented after being…

In this paper we look at a connection between the $\ell_q,0\leq q\leq 1$, optimization and under-determined linear systems of equations with sparse solutions. The case $q=1$, or in other words $\ell_1$ optimization and its a connection with…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…