More Like this

1. The structure of the singular set in the thin obstacle problem for degenerate parabolic equations

   https://doi.org/10.1007/s00526-021-01938-2  

   Banerjee, Agnid; Danielli, Donatella; Garofalo, Nicola; Petrosyan, Arshak (April 2021, Calculus of Variations and Partial Differential Equations)

   Abstract We study the singular set in the thin obstacle problem for degenerate parabolic equations with weight$$|y|^a$$ ${\left|y\right|}^a$for$$a \in (-1,1)$$ $a\in (-1,1)$. Such problem arises as the local extension of the obstacle problem for the fractional heat operator$$(\partial _t - \Delta _x)^s$$ ${({\partial }_t-{\Delta }_x)}^s$for$$s \in (0,1)$$ $s\in (0,1)$. Our main result establishes the complete structure and regularity of the singular set of the free boundary. To achieve it, we prove Almgren-Poon, Weiss, and Monneau type monotonicity formulas which generalize those for the case of the heat equation ($$a=0$$ $a=0$). 

   more » « less
2. Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity

   https://doi.org/10.1007/s00453-023-01102-6  

   Akmal, Shyan; Chen, Lijie; Jin, Ce; Raj, Malvika; Williams, Ryan (February 2023, Algorithmica)

   Abstract In a Merlin–Arthur proof system, the proof verifier (Arthur) accepts valid proofs (from Merlin) with probability 1, and rejects invalid proofs with probability arbitrarily close to 1. The running time of such a system is defined to be the length of Merlin’s proof plus the running time of Arthur. We provide new Merlin–Arthur proof systems for some key problems in fine-grained complexity. In several cases our proof systems have optimal running time. Our main results include:Certifying that a list ofnintegers has no 3-SUM solution can be done in Merlin–Arthur time$$\tilde{O}(n)$$ $\tilde{O}\left(n\right)$. Previously, Carmosino et al. [ITCS 2016] showed that the problem has a nondeterministic algorithm running in$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$time (that is, there is a proof system with proofs of length$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$and a deterministic verifier running in$$\tilde{O}(n^{1.5})$$ $\tilde{O}\left(n^{1.5}\right)$time).Counting the number ofk-cliques with total edge weight equal to zero in ann-node graph can be done in Merlin–Arthur time$${\tilde{O}}(n^{\lceil k/2\rceil })$$ $\tilde{O}\left(n^{\lceil k/2\rceil }\right)$(where$$k\ge 3$$ $k\ge 3$). For oddk, this bound can be further improved for sparse graphs: for example, counting the number of zero-weight triangles in anm-edge graph can be done in Merlin–Arthur time$${\tilde{O}}(m)$$ $\tilde{O}\left(m\right)$. Previous Merlin–Arthur protocols by Williams [CCC’16] and Björklund and Kaski [PODC’16] could only countk-cliques in unweighted graphs, and had worse running times for smallk.Computing the All-Pairs Shortest Distances matrix for ann-node graph can be done in Merlin–Arthur time$$\tilde{O}(n^2)$$ $\tilde{O}\left(n^2\right)$. Note this is optimal, as the matrix can have$$\Omega (n^2)$$ $\Omega \left(n^2\right)$nonzero entries in general. Previously, Carmosino et al. [ITCS 2016] showed that this problem has an$$\tilde{O}(n^{2.94})$$ $\tilde{O}\left(n^{2.94}\right)$nondeterministic time algorithm.Certifying that ann-variablek-CNF is unsatisfiable can be done in Merlin–Arthur time$$2^{n/2 - n/O(k)}$$ $2^{n/2-n/O\left(k\right)}$. We also observe an algebrization barrier for the previous$$2^{n/2}\cdot \textrm{poly}(n)$$ $2^{n/2}·\text{poly}\left(n\right)$-time Merlin–Arthur protocol of R. Williams [CCC’16] for$$\#$$ $\#$SAT: in particular, his protocol algebrizes, and we observe there is no algebrizing protocol fork-UNSAT running in$$2^{n/2}/n^{\omega (1)}$$ $2^{n/2}/n^{\omega \left(1\right)}$time. Therefore we have to exploit non-algebrizing properties to obtain our new protocol.Certifying a Quantified Boolean Formula is true can be done in Merlin–Arthur time$$2^{4n/5}\cdot \textrm{poly}(n)$$ $2^{4n/5}·\text{poly}\left(n\right)$. Previously, the only nontrivial result known along these lines was an Arthur–Merlin–Arthur protocol (where Merlin’s proof depends on some of Arthur’s coins) running in$$2^{2n/3}\cdot \textrm{poly}(n)$$ $2^{2n/3}·\text{poly}\left(n\right)$time.Due to the centrality of these problems in fine-grained complexity, our results have consequences for many other problems of interest. For example, our work implies that certifying there is no Subset Sum solution tonintegers can be done in Merlin–Arthur time$$2^{n/3}\cdot \textrm{poly}(n)$$ $2^{n/3}·\text{poly}\left(n\right)$, improving on the previous best protocol by Nederlof [IPL 2017] which took$$2^{0.49991n}\cdot \textrm{poly}(n)$$ $2^{0.49991n}·\text{poly}\left(n\right)$time. 

   more » « less
3. Toward extracting $$\gamma $$ from $$B\rightarrow DK$$ without binning

   https://doi.org/10.1140/epjc/s10052-023-12057-x  

   Backus, Jeffrey V.; Freytsis, Marat; Grossman, Yuval; Schacht, Stefan; Zupan, Jure (September 2023, The European Physical Journal C)

   Abstract $$B^\pm \rightarrow DK^\pm $$ $B^{\pm }\to D{K}^{\pm }$transitions are known to provide theoretically clean information about the CKM angle$$\gamma $$ $\gamma$, with the most precise available methods exploiting the cascade decay of the neutralDintoCPself-conjugate states. Such analyses currently require binning in theDdecay Dalitz plot, while a recently proposed method replaces this binning with the truncation of a Fourier series expansion. In this paper, we present a proof of principle of a novel alternative to these two methods, in which no approximations at the level of the data representation are required. In particular, our new strategy makes no assumptions about the amplitude and strong phase variation over the Dalitz plot. This comes at the cost of a degree of ambiguity in the choice of test statistic quantifying the compatibility of the data with a given value of$$\gamma $$ $\gamma$, with improved choices of test statistic yielding higher sensitivity. While our current proof-of-principle implementation does not demonstrate optimal sensitivity to$$\gamma $$ $\gamma$, its conceptually novel approach opens the door to new strategies for$$\gamma $$ $\gamma$extraction. More studies are required to see if these can be competitive with the existing methods. 

   more » « less
4. An Efficient ZK Compiler from SIMD Circuits to General Circuits

   https://doi.org/10.1007/s00145-024-09531-4  

   Bui, Dung; Chu, Haotian; Couteau, Geoffroy; Wang, Xiao; Weng, Chenkai; Yang, Kang; Yu, Yu (January 2025, Journal of Cryptology)

   Abstract We propose a generic compiler that can convert any zero-knowledge (ZK) proof for SIMD circuits to general circuits efficiently, and an extension that can preserve the space complexity of the proof systems. Our compiler can immediately produce new results improving upon state of the art.By plugging in our compiler to Antman, an interactive sublinear-communication protocol, we improve the overall communication complexity for general circuits from$$\mathcal {O}(C^{3/4})$$ $O\left(C^{3/4}\right)$to$$\mathcal {O}(C^{1/2})$$ $O\left(C^{1/2}\right)$. Our implementation shows that for a circuit of size$$2^{27}$$ $2^{27}$, it achieves up to$$83.6\times $$ $83.6\times$improvement on communication compared to the state-of-the-art implementation. Its end-to-end running time is at least$$70\%$$ $70\%$faster in a 10Mbps network.Using the recent results on compressed$$\varSigma $$ $\Sigma$-protocol theory, we obtain a discrete-log-based constant-round zero-knowledge argument with$$\mathcal {O}(C^{1/2})$$ $O\left(C^{1/2}\right)$communication and common random string length, improving over the state of the art that has linear-size common random string and requires heavier computation.We improve the communication of a designatedn-verifier zero-knowledge proof from$$\mathcal {O}(nC/B+n^2B^2)$$ $O(nC/B+n^2{B}^2)$to$$\mathcal {O}(nC/B+n^2)$$ $O(nC/B+n^2)$.To demonstrate the scalability of our compilers, we were able to extract a commit-and-prove SIMD ZK from Ligero and cast it in our framework. We also give one instantiation derived from LegoSNARK, demonstrating that the idea of CP-SNARK also fits in our methodology. 

   more » « less
5. $$^{222}$$Rn  emanation measurements for the XENON1T experiment

   https://doi.org/10.1140/epjc/s10052-020-08777-z  

   XENON Collaboration; Aprile, E.; Aalbers, J.; Agostini, F.; Alfonsi, M.; Althueser, L.; Amaro, F. D.; Antochi, V. C.; Angelino, E.; Angevaare, J. R.; et al (April 2021, The European Physical Journal C)

   Abstract The selection of low-radioactive construction materials is of utmost importance for the success of low-energy rare event search experiments. Besides radioactive contaminants in the bulk, the emanation of radioactive radon atoms from material surfaces attains increasing relevance in the effort to further reduce the background of such experiments. In this work, we present the$$^{222}$$ ${}^{222}$Rn emanation measurements performed for the XENON1T dark matter experiment. Together with the bulk impurity screening campaign, the results enabled us to select the radio-purest construction materials, targeting a$$^{222}$$ ${}^{222}$Rn activity concentration of$$10\,\mathrm{\,}\upmu \mathrm{Bq}/\mathrm{kg}$$ $10\mu \mathrm{Bq}/\mathrm{kg}$in$$3.2\,\mathrm{t}$$ $3.2t$of xenon. The knowledge of the distribution of the$$^{222}$$ ${}^{222}$Rn sources allowed us to selectively eliminate problematic components in the course of the experiment. The predictions from the emanation measurements were compared to data of the$$^{222}$$ ${}^{222}$Rn activity concentration in XENON1T. The final$$^{222}$$ ${}^{222}$Rn activity concentration of$$(4.5\pm 0.1)\,\mathrm{\,}\upmu \mathrm{Bq}/\mathrm{kg}$$ $(4.5\pm 0.1)\mu \mathrm{Bq}/\mathrm{kg}$in the target of XENON1T is the lowest ever achieved in a xenon dark matter experiment. 

   more » « less