The transformed $l_1$ penalty (TL1) functions are a one parameter family of bilinear transformations composed with the absolute value function. When acting on vectors, the TL1 penalty interpolates $l_0$ and $l_1$ similar to $l_p$ norm, where $p$ is in $(0,1)$. In our companion paper, we showed that TL1 is a robust sparsity promoting penalty in compressed sensing (CS) problems for a broad range of incoherent and coherent sensing matrices. Here we develop an explicit fixed point representation for the TL1 regularized minimization problem. The TL1 thresholding functions are in closed form for all parameter values. In contrast, the $l_p$ thresholding functions ($p$ is in $[0,1]$) are in closed form only for $p=0;1;1=2;2=3$, known as hard, soft, half, and 2/3 thresholding respectively. The TL1 threshold values differ in subcritical (supercritical) parameter regime where the TL1 threshold functions are continuous (discontinuous) similar to soft-thresholding (half-thresholding) functions. We propose TL1 iterative thresholding algorithms and compare them with hard and half thresholding algorithms in CS test problems. For both incoherent and coherent sensing matrices, a proposed TL1 iterative thresholding algorithm with adaptive subcritical and supercritical thresholds (TL1IT-s1 for short), consistently performs the best in sparse signal recovery with and without measurement noise.

We study orthogonal polynomials with respect to self-similar measures, focusing on the class of infinite Bernoulli convolutions, which are defined by iterated function systems with overlaps, especially those defined by the Pisot, Garsia, and Salem numbers. By using an algorithm of Mantica, we obtain graphs of the coefficients of the 3-term recursion relation defining the orthogonal polynomials. We use these graphs to predict whether the singular infinite Bernoulli convolutions belong to the Nevai class. Based on our numerical results, we conjecture that all infinite Bernoulli Convolutions with contraction ratios greater than or equal to 1/2 belong to Nevai's class, regardless of the probability weights assigned to the self-similar measures.

No abstract uploaded!

We construct the Frobenius structure on a rigid connection Be_{\hat G} on G_m for a split reductive group \hat G introduced by Frenkel-Gross. These data form a \hat G-valued overconvergent F-isocrystal Be^†_{\hat G} on G_{m,F_p}, which is the p-adic companion of the Kloosterman \hat G-local system Kl_{\hat G} constructed by Heinloth-Ngô-Yun. By studying the structure of the underlying differential equation, we calculate the monodromy group of Be^†_{\hat G} when \hat G is almost simple (which recovers the calculation of monodromy group of Kl_{\hat G} due to Katz and Heinloth–Ngô–Yun), and prove a conjecture of Heinloth-Ngô-Yun on the functoriality between different Kloosterman \hat G-local systems. We show that the Frobenius Newton polygons of Kl_{\hat G} are generically ordinary for every \hat G and are everywhere ordinary on |G_{m,F_p}| when \hat G is classical or G_2.

No abstract uploaded!