More Like this

1. On the Moduli of Lipschitz Homology Classes

   https://doi.org/10.1007/s12220-025-01916-6  

   Kangasniemi, Ilmari; Prywes, Eden (February 2025, The Journal of Geometric Analysis)

   Abstract We define a type of modulus$$\operatorname {dMod}_p$$ ${dMod}_p$for Lipschitz surfaces based on$$L^p$$ $L^p$-integrable measurable differential forms, generalizing the vector modulus of Aikawa and Ohtsuka. We show that this modulus satisfies a homological duality theorem, where for Hölder conjugate exponents$$p, q \in (1, \infty )$$ $p,q\in (1,\infty )$, every relative Lipschitzk-homology classchas a unique dual Lipschitz$$(n-k)$$ $(n-k)$-homology class$$c'$$ $c^{\prime }$such that$$\operatorname {dMod}_p^{1/p}(c) \operatorname {dMod}_q^{1/q}(c') = 1$$ ${dMod}_p^{1/p}\left(c\right){dMod}_q^{1/q}\left(c^{\prime }\right)=1$and the Poincaré dual ofcmaps$$c'$$ $c^{\prime }$to 1. As$$\operatorname {dMod}_p$$ ${dMod}_p$is larger than the classical surface modulus$$\operatorname {Mod}_p$$ ${Mod}_p$, we immediately recover a more general version of the estimate$$\operatorname {Mod}_p^{1/p}(c) \operatorname {Mod}_q^{1/q}(c') \le 1$$ ${Mod}_p^{1/p}\left(c\right){Mod}_q^{1/q}\left(c^{\prime }\right)\le 1$, which appears in works by Freedman and He and by Lohvansuu. Our theory is formulated in the general setting of Lipschitz Riemannian manifolds, though our results appear new in the smooth setting as well. We also provide a characterization of closed and exact Sobolev forms on Lipschitz manifolds based on integration over Lipschitzk-chains. 

   more » « less
2. Transversality of holomorphic maps into hyperquadrics

   https://doi.org/10.1007/s00208-025-03134-5  

   Huang, Xiaojun; Zhu, Weixia (March 2025, Mathematische Annalen)

   Abstract We study holomorphic mapsFfrom a smooth Levi non-degenerate real hypersurface$$ M_{\ell }\subset {\mathbb {C}}^n $$ $M_{\ell }\subset C^n$into a hyperquadric$$ {\mathbb {H}}_{\ell '}^N $$ $H_{{\ell }^{\prime }}^N$with signatures$$ \ell \le (n-1)/2 $$ $\ell \le (n-1)/2$and$$ \ell '\le (N-1)/2,$$ ${\ell }^{\prime }\le (N-1)/2,$respectively. Assuming that$$ N - n < n - 1,$$ $N-n<n-1,$we prove that if$$ \ell = \ell ',$$ $\ell ={\ell }^{\prime },$thenFis either CR transversal to$$ {\mathbb {H}}_{\ell }^N $$ $H_{\ell }^N$at every point of$$ M_{\ell },$$ $M_{\ell },$or it maps a neighborhood of$$ M_{\ell } $$ $M_{\ell }$in$$ {\mathbb {C}}^n $$ $C^n$into$$ {\mathbb {H}}_{\ell }^N.$$ $H_{\ell }^N.$Furthermore, in the case where$$ \ell ' > \ell ,$$ ${\ell }^{\prime }>\ell ,$we show that ifFis not CR transversal at$$0\in M_\ell ,$$ $0\in M_{\ell },$then it must be transversally flat. The latter is best possible. 

   more » « less
3. On a Traveling Salesman Problem for Points in the Unit Cube

   https://doi.org/10.1007/s00453-024-01257-w  

   Balogh, József; Clemen, Felix Christian; Dumitrescu, Adrian (September 2024, Algorithmica)

   Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ ${[0,1]}^k$where$$k \ge 2$$ $k\ge 2$. According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ $x_1,x_2,\dots ,x_n$through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}\le c_k$, where$$|x-y|$$ $|x-y|$is the Euclidean distance betweenxandy, and$$c_k$$ $c_k$is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ $x_{n+1}\equiv x_1$. From the other direction, for every$$k \ge 2$$ $k\ge 2$and$$n \ge 2$$ $n\ge 2$, there existnpoints in$$[0,1]^k$$ ${[0,1]}^k$, such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ ${\left({\sum }_{i=1}^n,{|x_i-x_{i+1}|}^k\right)}^{1/k}=2^{1/k}·\sqrt{k}$. For the plane, the best constant is$$c_2=2$$ $c_2=2$and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=9{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$for every$$k \ge 3$$ $k\ge 3$and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ $c_k=2^{1/k}·\sqrt{k}$, for every$$k \ge 2$$ $k\ge 2$. Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ $c_k=3\sqrt{5}{\left(\frac{2}{3}\right)}^{1/k}·\sqrt{k}$or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ $c_k=2.91\sqrt{k}(1+o_k\left(1\right))$. Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ $c_3\ge 2^{7/6}$, which disproves the conjecture for$$k=3$$ $k=3$. Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. 

   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. Global well-posedness for 2D generalized parabolic Anderson model via paracontrolled calculus

   https://doi.org/10.1007/s40072-025-00358-z  

   Shen, Hao; Zhu, Rongchan; Zhu, Xiangchan (May 2025, Stochastics and Partial Differential Equations: Analysis and Computations)

   Abstract This article revisits the problem of global well-posedness for the generalized parabolic Anderson model on$$\mathbb {R}^+\times \mathbb {T}^2$$ $R^{+}\times T^2$within the framework of paracontrolled calculus (Gubinelli et al. in Forum Math, 2015). The model is given by the equation:$$\begin{aligned} (\partial _t-\Delta ) u=F(u)\eta \end{aligned}$$ $\begin{array}{c}({\partial }_t-\Delta )u=F\left(u\right)\eta \end{array}$where$$\eta \in C^{-1-\kappa }$$ $\eta \in C^{-1-\kappa }$with$$1/6>\kappa >0$$ $1/6>\kappa >0$, and$$F\in C_b^2(\mathbb {R})$$ $F\in C_b^2\left(R\right)$. Assume that$$\eta \in C^{-1-\kappa }$$ $\eta \in C^{-1-\kappa }$and can be lifted to enhanced noise, we derive new a priori bounds. The key idea follows from the recent work by Chandra et al. (A priori bounds for 2-d generalised Parabolic Anderson Model,,2024), to represent the leading error term as a transport type term, and our techniques encompass the paracontrolled calculus, the maximum principle, and the localization approach (i.e. high-low frequency argument). 

   more » « less