오픈뉴스백과
세계의 오늘한국의 오늘라이브둘러보기뉴스ONP 브리핑
뉴스로 배우기커뮤니티회사학술과학정부용어사전피드 제보내 편향
...

오픈뉴스백과

집단지성 기반 뉴스 검증 플랫폼. 다양한 시각으로 뉴스를 이해합니다.

서비스

세계의 오늘한국의 오늘라이브뉴스정부과학학술용어사전소개

법적 고지

개인정보처리방침이용약관콘텐츠 이용 안내

문의

문의하기

본 플랫폼에서 제공하는 뉴스 콘텐츠의 저작권은 각 언론사에 있으며, 무단 복제 및 배포를 금지합니다.

RSS 피드를 통해 수집된 콘텐츠는 각 원저작자의 라이선스 조건을 따릅니다. 오픈 라이선스(CC-BY 등) 콘텐츠는 해당 라이선스에 따라 출처를 표기합니다.

오픈뉴스백과는 뉴스 집계 및 검증 플랫폼으로, 개별 기사의 내용에 대한 책임은 해당 언론사에 있습니다.

이용자가 작성한 피드백, 팩트체크, 독자 제보 등의 콘텐츠에 대한 책임은 해당 작성자에게 있습니다.

콘텐츠 제거·정정이 필요하시면 문의하기에 남겨 주세요.

© 2026 오픈뉴스백과 (OpenNewsPedia). All rights reserved.

📑

학술

arXiv 등 학술 논문. CC-BY 라이선스로 자유 재사용 가능 — 출처표시 시 상업 사용 OK.

총 10,515건

분야

전체arXiv Math10,515arXiv CS.AI7,467arXiv Physics3,497arXiv Stat1,674PLOS ONE751arXiv Econ493arXiv Q-Bio433eLife157PLOS Global Public Health111PLOS Biology55PLOS Medicine43
arXiv Math

Counting and Sampling Anti-ferromagnetic Potts Models on Random Regular Bipartite Graphs in the Non-uniqueness Regime

arXiv:2606.21250v2 Announce Type: replace-cross Abstract: The anti-ferromagnetic multi-state Potts model, a generalization of the Ising model, is one of the most fundamental models in statistical physics. It was conjectured by Koteck\'{y} (Phys. Rev. B, 1985) that the model undergoes a phase transition from a disordered phase at infinite temperature to an ordered phase at sufficiently low temperature on lattices. Such phase transitions are believed to play an important role in computational complexity theory and remain closely connected to the problem of approximating the partition function of the system. For proper three-coloring models (corresponding to the zero-temperature), torpid mixing of a family of local-update Markov chains on lattices was established by Galvin, Kahn, Randall and Sorkin (SIDMA, 2015), coinciding with the presence of phase coexistence following shown by Feldheim and Spinka (J. Eur. Math. Soc., 2019). In this work, we study approximating the partition function of the anti-ferromagnetic multi-state Potts model at low temperature on random regular bipartite graphs, which are with high probability good bipartite expanders. On the negative side, we generalize the result by Geisler, Kang, Sarantis and Wdowinski (arXiv, 2026) for anti-ferromagnetic Ising models to show that when the temperature is sufficiently low relative to the degree of the underlying graph, the celebrated single-site Glauber dynamics has exponentially slow mixing time. On the positive side, we design a deterministic algorithm that yields an approximation to the partition function of the model via the framework of abstract polymer models as Jenssen, Keevash and Perkins (SICOMP, 2020), Liao, Lin, Lu and Mao (Theor. Comput. Sci., 2022), Galanis, Goldberg and Stewart (TOCT, 2021) and Geisler, Kang, Sarantis and Wdowinski (arXiv, 2026).

arXiv Math

Conformity-Based Bayesian Projective Prediction

arXiv:2605.24601v2 Announce Type: replace-cross Abstract: We propose a general robust prediction framework, termed conformity-based projective prediction (CPP), that integrates Bayesian predictive modeling with ideas from conformity-based conformal prediction. Rather than assessing conformity through residual-based scores, the CPP criterion defines conformity distributionally: a candidate value for a future response is considered conforming to the extent that its inclusion in the data leaves the leave-one-out predictive distributions of the observed responses undisturbed. The framework requires only that the leave-one-out and swapped predictive distributions are available in closed form and that the swapped predictive mean is differentiable in the candidate value. Under these conditions, we establish a general bounded-influence proposition and a general local convexity lemma, and prove that CPP dominates any plug-in predictor with unbounded influence in asymptotic variance under $\epsilon$-contamination models. When the posterior mean is linear in the observations -- as in Gaussian linear models, basis-expansion regression, and Gaussian process regression -- the swapped predictive mean is affine in the candidate value, yielding closed-form or one-dimensional optimization solutions and an efficient rank-two computational update; all general theoretical results specialize to explicit corollaries in this setting. Simulation experiments and two data analyses under the Gaussian linear model illustrate the finite-sample advantages of the proposed method, confirming the theoretical predictions across contamination levels, sample sizes, and predictor dimensions.

arXiv Math

Sampling Simultaneous Edge-Colorings

arXiv:2605.05046v2 Announce Type: replace-cross Abstract: We study the sampling problem for simultaneous edge colorings. Given a pair of graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ which are on the same vertex set $V$, a simultaneous edge coloring is an edge coloring of $G_1\cup G_2$ so that each of the individual graphs is properly colored. When each of $G_1$ and $G_2$ are of maximum degree $\Delta$, then it is conjectured that $\Delta+2$ colors suffice, and recent work asymptotically establishes the conjecture. We study Markov chains for randomly sampling from the uniform distribution over simultaneous edge colorings. Straightforward applications of Jerrum's classical coupling argument establish rapid mixing of the Glauber dynamics on the corresponding line graph when $k>8\Delta$. We present a simple weighted Hamming distance for which Jerrum's coupling yields optimal mixing time (up to constant factors) of $O(m\log{n})$ when $k>(6+\delta)\Delta$ for any fixed $\delta>0$. Moreover, utilizing the flip dynamics with our new metric, we obtain $O(m\log{n})$ mixing of the flip dynamics when $k\geq 5.948\Delta$, using a local choice of flip parameters which only flips bounded-size components. The proof adapts previous coupling analyses for the flip dynamics to the setting of simultaneous edge colorings.

arXiv Math

Kramers-Kronig Relations and Causality in Non-Markovian Open Quantum Dynamics: Kernel, State, and Effective Kernel

arXiv:2604.17058v5 Announce Type: replace-cross Abstract: Causality -- that a response cannot precede its cause -- is among the most universal constraints in physics. Yet when a unitary microscopic theory is reduced to an open-system memory-kernel equation, causality is not inherited for free: an upper-half-plane pole of the kernel forces exponential growth of the reduced propagator and is incompatible with any completely positive trace-preserving (CPTP) reduced dynamics. We examine three objects with different causal structure under projection -- the Nakajima-Zwanzig (NZ) memory kernel $\tilde{\mathcal{K}}(z)$, the reduced-state Laplace transform $\tilde{\sigma}(z)$, and the force-fit effective kernel $\tilde{\mathcal{K}}_\text{eff}(z)$ -- using the Kramers-Kronig (KK) relations as diagnostic. Under a real-axis spectral hypothesis on the projected generator, $\tilde{\mathcal{K}}(z)$ lies in a vector-valued Hardy space and obeys (subtracted) KK relations, giving a CPTP-consistency criterion, a passivity-analyticity statement, and a Carleman diagnostic. We prove $\tilde{\sigma}(z)$ analytic in the upper half-plane for any initial state -- unitarity bounds $\|\sigma(t)\|_{\mathrm{op}} \leq 1$, so acausality cannot be blamed on the state alone. Yet the force-fit kernel can develop upper-half-plane poles at simple zeros of $\tilde{\sigma}(z)$: passive baths sit in a robust regime where these zeros stay real, while near-resonant systems enter a fragile regime in which coherence-channel zeros migrate into the upper half-plane, an intrinsic symmetry property already present for factorized states. We verify the full operator-valued KK relation on the extracted $4\times4$ NZ memory kernel of the Jaynes-Cummings model, the relative $L_2$ residual decreasing under refinement ($3.8\% \to 0.95\%$), consistent with exact matrix-valued KK in the continuum limit.

arXiv Math

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics

arXiv:2604.05661v2 Announce Type: replace-cross Abstract: We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an algorithm for the Traveling Salesperson Problem that solves $N$-vertex instances using space $S$ and time $T$ where $S\cdot T \leq 3.1861^{N}$. This improves a previous work by Koivisto and Parviainen [SODA'10] where $S\cdot T \leq 3.9271^N$, and overcomes a barrier they identified, as their bound was shown to be optimal within their framework. To get our results, we introduce a new parameter of a set system that we call the chain efficiency. This relates the number of maximal chains contained in the set system with the cardinality of the system. We show that set systems of high efficiency imply efficient space-time tradeoffs for permutation problems, and give constructions of set systems with high chain efficiency, disproving a conjecture by Johnson, Leader and Russel [Comb. Probab. Comput.'15].

arXiv Math

Topological bounds on the dynamical growth rate of chemical reaction networks

arXiv:2603.02627v3 Announce Type: replace-cross Abstract: Growth and decay are system-level properties of chemical reaction networks (CRNs) relevant from prebiotic chemistry to cellular metabolism. Their properties are typically analyzed through the kinetics of particular models, which requires specification of the full set of kinetic laws and parameters. In this work, assuming a steady balanced-growth regime, we derive stoichiometry-based constraints on the growth (or shrinkage) rate. The resulting bounds are controlled by a topological quantity, the maximum amplification factor, defined via a von Neumann max-min problem over feasible fluxes as illustrated by numerical tests on random-network ensembles of CRNs. We argue for the relevance of our results in the context of origins of life studies and the design of synthetic chemical reaction networks.

arXiv Math

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets

arXiv:2602.20578v2 Announce Type: replace-cross Abstract: We study online maximization of non-monotone Diminishing-Return(DR)-submodular functions over down-closed convex sets, a regime where existing projection-free online methods suffer from suboptimal regret and limited feedback guarantees. Our main contribution is a new structural result showing that this class is $1/e$-linearizable under carefully designed exponential reparametrization, scaling parameter, and surrogate potential, enabling a reduction to online linear optimization. As a result, we obtain $O(T^{1/2})$ static regret with a single gradient query per round and unlock adaptive and dynamic regret guarantees, together with improved rates under semi-bandit, bandit, and zeroth-order feedback. Across all feedback models, our bounds strictly improve the state of the art.

arXiv Math

The matrix-vector complexity of $Ax=b$

arXiv:2602.04842v3 Announce Type: replace-cross Abstract: Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establishes lower bounds on the worst-case number of matrix--vector products needed by such an algorithm to approximately solve a general linear system. The first main result is that, for any matrix--vector algorithm which is allowed the use of randomization and can perform products with both a matrix and its transpose, $\Omega(\kappa \log(1/\varepsilon))$ matrix--vector products are necessary to solve a linear system with condition number $\kappa$ to accuracy $\varepsilon$, matching an upper bound for conjugate gradient on the normal equations. The second main result is that one-sided algorithms, which lack access to the transpose, must use $n$ matrix--vector products to solve an $n \times n$ linear system, even when the problem is perfectly conditioned. Both main results include explicit constants that match known upper bounds up to a factor of four. These results rigorously demonstrate the limitations of matrix--vector algorithms and confirm the optimality of widely used Krylov subspace algorithms.

arXiv Math

On theta function expressions of cyclic products of fermion correlation functions in genus two

arXiv:2601.08664v3 Announce Type: replace-cross Abstract: In arXiv:2211.09069, significant progress was made in decomposing simple products of fermion correlation functions, and in summing over spin structures of superstring amplitudes in genus two under cyclic constraints. In this manuscript we consider part of the same subject using a framework in which one of the branch points of the genus two curve is fixed at infinity. This framework is a direct generalization of the popular one in the case of genus one. We address some of the issues that remained unresolved in our previous paper arXiv:2209.14633. We show that the spin structures of the simple products of fermion correlation functions with cyclic conditions depend only on the Pe-function values at the half-periods of the genus two surface, for any number of factors in the products. Similar to the genus one case, we can provide basis functions to decompose the product. Consequently, the trilinear relations found in arXiv:2211.09069 can be derived from the known set of differential equations of genus two Pe-functions by setting the variables equal to the half-periods of the non-singular and even spin structures, as is the case for genus one. Based on these considerations, we present a procedure for expressing the results of decomposed formulae in terms of the unique genus two theta function for two, three, and four point cases, and discuss a realistic approach for calculating six point function. A general formula for the expression of the results in terms of the theta function for the product of an arbitrary number of the fermion correlation functions is not yet derivable.

arXiv Math

Optimal Spatial Anomaly Detection

arXiv:2510.22330v3 Announce Type: replace-cross Abstract: There has been a growing interest in anomaly detection problems recently, whilst their focuses are mostly on anomalies taking place on the time index. In this work, we investigate a new anomaly-in-mean problem in multidimensional spatial lattice, that is, to detect the number and locations of anomaly ``spatial regions'' from the baseline. In addition to the classic minimization over the cost function with a $L_0$ penalization, we introduce an innovative penalty on the area of the minimum convex hull that covers the anomaly regions. We show that the proposed method yields a consistent estimation of the number and locations of spatial anomalies. Under the minimax framework, we characterize the optimal detection error for multidimensional spatial anomaly detection problem and reveal the trade-off between detection performance and the geometric flexibility of anomaly region shapes. Large-scale Monte Carlo simulations are carried out to examine the numeric performance of the method. The method has a wide range of applications in real-world problems. As an example, we apply it to detect the marine heatwaves using the sea surface temperature data from the European Space Agency.

arXiv Math

A free fermions in disguise model with claws

arXiv:2508.05789v2 Announce Type: replace-cross Abstract: Recently, several spin chain models have been discovered that admit solutions in terms of "free fermions in disguise." A graph-theoretical treatment of such models was also established, giving sufficient conditions for free fermionic solvability. These conditions involve a particular property of the so-called frustration graph of the Hamiltonian, namely that it must be claw-free. Additionally, one set of sufficient conditions also requires the absence of so-called even holes. In this paper, we present a model with disguised free fermions where the frustration graph contains both claws and even holes. Special relations between coupling constants ensure that the free fermionic property still holds. Notably, the central elements associated with the even holes can be removed by fixing the gauge, revealing our model to be an integrable deformation within the original algebra of free fermions in disguise. The transfer matrix of this model can be factorized in a special case, thereby proving the conjectured free fermionic nature of a special quantum circuit published recently by two of the present authors.

arXiv Math

All Hilbert spaces are the same: consequences for generalized coordinates and momenta

arXiv:2502.08494v4 Announce Type: replace-cross Abstract: Making use of the simple fact that all separable complex Hilbert spaces of given dimension are isomorphic, we show that there are just six basic ways to define generalized coordinate operators in Quantum Mechanics. In each case a canonically conjugate generalized momentum operator can be defined, but it may not be self-adjoint. Even in those cases we show there is always either a self-adjoint extension of the operator or a Neumark extension of the Hilbert space that produces a self-adjoint momentum operator. In one of the six cases both extensions work, thus leading to seven basic pairs of coordinate and momentum operators. We also show why there are more ways of defining basic coordinate and momentum measurements. A special role is reserved for measurements that simultaneously measure both.

arXiv Math

BFS versus DFS for fixed-level targets in ordered trees

arXiv:2404.05664v2 Announce Type: replace-cross Abstract: We find the average time complexity of the breadth-first search (BFS) and the depth-first search (DFS) algorithms, when one searches for a target node selected uniformly at random among all nodes at level $\ell$ in the set of ordered trees with $n$ edges. Intuition suggests that on average BFS must be asymptotically faster than DFS if and only if $\ell$, as a function of $n$, is below a certain threshold. We confirm this intuition by showing that there exists a unique constant $\lambda\approx 0.789004$, such that in expectation BFS is asymptotically faster than DFS if and only if $\ell\leq \lambda\sqrt{n}$. This gives us a practical rule to select between the two algorithms, even when we do not know the exact value of $\ell$, but only an estimate of it. Furthermore, we find the asymptotic average time complexity of BFS in the given setting for an arbitrary class of Galton--Watson trees, which includes ordered trees, binary trees, and other popular classes. We use results on the occupation measure of Brownian excursions, as well as combinatorial identities related to lattice paths. Finally, we consider the simple \textit{truncated DFS} algorithm, which can be shown easily to be asymptotically faster than both BFS and DFS when $\ell$ is known in advance. We show that in fact its asymptotic time complexity is $1/2$ of the asymptotic complexity of BFS, when $\ell = s\sqrt{n}$ for any constant $s$. Several further questions are also raised.

arXiv Math

Construction of orientable sequences in $O(1)$-amortized time per bit

arXiv:2401.14341v4 Announce Type: replace-cross Abstract: An orientable sequence of order $n$ is a cyclic binary sequence such that each length-$n$ substring appears at most once \emph{in either direction}. Maximal length orientable sequences are known only for $n\leq 7$, and a trivial upper bound on their length is $2^{n-1} - 2^{\lfloor(n-1)/2\rfloor}$. This paper presents the first efficient algorithm to construct orientable sequences that reach this upper bound, asymptotically; more specifically, our algorithm constructs orientable sequences via cycle-joining and a successor-rule approach requiring $O(n)$ time per bit and $O(n)$ space. This answers a longstanding open question from Dai, Martin, Robshaw, Wild [Cryptography and Coding III (1993)]. Applying a recent concatenation-tree framework, the same sequences can be generated in $O(1)$-amortized time per bit using $O(n^2)$ space. Our sequences are applied to find new longest-known (aperiodic) orientable sequences for $n\leq 20$.

arXiv Math

2d BF Theory Coupled to 1d Quantum Mechanics: The Phase Space and Its Quantization

arXiv:2111.06876v4 Announce Type: replace-cross Abstract: We study the ring of functions on the (classical and quantized) phase space of 2-dimensional BF theory with the gauge group $\mathrm{GL}_N$ coupled to a 1-dimensional quantum mechanics with global symmetry $\mathrm{GL}_K$. These functions are gauge-invariant local observables of the coupled system. We first construct the classical phase space of this system and describe its ring of functions, as well as their large-$N$ limit. We next compute the Hilbert series of these algebras for finite $N$ and in the large-$N$ limit. We then study the quantization of this phase space and the deformation quantization of its ring of functions, elaborate its relation to the Yangian, and construct its coproduct. Finally, we identify these quantized algebras with the quantized Coulomb branch algebras of certain 3d $\mathscr{N}=4$ quiver gauge theories.

arXiv Math

A Fourier analytique approach to Gaussian mixture learning

arXiv:2004.05813v3 Announce Type: replace-cross Abstract: Suppose that we are given independent, identically distributed random samples $x_1,\cdots,x_n$ from a mixture at most $k$ many $d$-dimensional spherical Gaussian distributions $\mu_1,\cdots,\mu_{k_0}$ of identical and known variance $\sigma^2$ in each coordinate, such that the minimum $\ell^2$ distance between two distinct centers $y_l$ and $y_j$ is greater than $2\Delta\sigma \min\{\sqrt{d},\sqrt k\}$, where $\Delta>C_0$, and $C_0$ is a sufficiently large universal constant. We develop a randomized algorithm that learns the centers $y_l$'s of the Gaussian components to within an $\ell^2$ distance of $k^{-\tilde C_0}$ -- in presence of arbitrarily large number of components and in arbitrary dimension, when the weights are known to be uniform. Furthermore, if the number of components is $k= \Omega(2^d)$, then for arbitrary universal constant $c>0$, even for unknown weights, the algorithm learns the centers to within an $\ell^2$ distance of $d^{-\tilde C_0}$ and the weights up to an accuracy of $cw_{min}$, with probability greater than $1 - \exp(-k/c)$, provided that the weights lie in $[c/k,1/ck]$, and the minimum separation is just $2c\sqrt d$. The number of samples and the computational time is bounded above by $\mathrm{poly}(k, d)$ in either case. Such a bound on the sample and computational complexity was previously unknown in the regime of non-constant dimension, and in particular, when $d$ is not $O(1)$. When $d = O(1)$, this complexity bound follows from work of Regev and Vijayaraghavan, where it has also been shown that the sample complexity of learning a random mixture of Gaussians in a ball of radius $o(\sqrt{d})$ in $d$ dimensions, when $d$ is $\Theta( \log k)$, is at least super-polynomial in $k, d$, showing that our result is tight in this case.

arXiv Math

The Frobenius problem for shifted square sequences

arXiv:2605.25542v3 Announce Type: replace Abstract: The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$, and finding the Frobenius number is called the Frobenius problem. In this paper, we resolve the conjecture of Frobenius problem for shifted square sequences suggested by Liu and Xin.

arXiv Math

Exponential Lower Bounds for the Pfaffian Number of Graphs

arXiv:2605.21077v2 Announce Type: replace Abstract: The Fisher--Kasteleyn--Temperley (FKT) algorithm counts perfect matchings in planar graphs in polynomial time using a single Pfaffian computation. Galluccio--Loebl and Tesler extended this Pfaffian method to graphs embedded in an orientable surface of genus $g$, showing that the perfect-matching polynomial can be written as a linear combination of at most $4^g$ Pfaffians. We prove that this exponential dependence on $g$ is unavoidable in general. More precisely, for every $g\ge1$, there exists a graph of orientable genus at most $g$ whose perfect-matching polynomial requires at least $(8/3)^g$ Pfaffians in any such linear representation. In particular, for every even integer $n\ge 6$, there is a graph on $n$ vertices with Pfaffian number at least $(8/3)^{\lfloor n/6\rfloor}$. Moreover, the lower bound is witnessed even by connected cubic bipartite matching-covered graphs of orientable genus exactly $g$. We also prove exponential lower bounds for complete bipartite graphs, and hence for even complete graphs, improving asymptotically on a recent linear lower bound of Junchaya, Miranda, and Lucchesi.

arXiv Math

Norm attainment for multilinear operators and polynomials on Banach Spaces and Banach lattices

arXiv:2605.12117v2 Announce Type: replace Abstract: We study norm attainment for multilinear operators and homogeneous polynomials between Banach spaces, as well as for positive multilinear operators between Banach lattices. We establish multilinear and polynomial versions of [23, Theorem B] and [35, Theorem 2.12]. More precisely, we provide sufficient conditions on Banach spaces $X_1, \dots, X_n$ and $Y$ ensuring that every $A \in \mathcal{L}(X_1, \dots, X_n; Y)$ (respectively, $P \in \mathcal{P}(^n X_1; Y)$) is weakly sequentially continuous if and only if it attains its norm. We also obtain analogous results for positive $n$-linear operators and positive $n$-homogeneous polynomials in the setting of Banach lattices.

arXiv Math

A Syndrome--Space Approach to Proximity Gaps and Correlated Agreement for Random Linear Codes and Random Reed--Solomon Codes

arXiv:2605.07595v2 Announce Type: replace Abstract: Proximity gaps and correlated agreement have become central tools in the analysis of interactive oracle proofs of proximity (IOPPs) and code-based SNARKs. Informally, a proximity-gap statement says that for a structured set of words -- such as an affine space, or a curve -- either all points are close to the code, or most are far from it. Such statements are essential in sampling-based proof systems, where a verifier queries only a few random locations on a structured object but must still obtain a global soundness guarantee. In Reed--Solomon-based proof systems, one would ideally like the proximity parameter to approach the information-theoretic limit $1-R$, since this is the largest possible radius for a rate-$R$ code and directly affects protocol efficiency. We establish a direct approach to proximity gaps and correlated agreement for random linear codes in the random parity-check-matrix model, without relying on list decoding of the proof. Our approach is based on a syndrome-space reformulation together with a witness-based reduction argument. It is conceptually different from the existing decoding-driven route for random linear codes, and it also leads to sharper parameters, including the optimal-up-to-$\varepsilon$ large-alphabet radius bound $\rho<1-R-\varepsilon$ for $q=\Theta(n)$, as well as near-capacity bounds over constant alphabets with improved alphabet-size requirements. We apply the same syndrome-space reductions to random Reed--Solomon codes. This yields correlated agreement for random Reed--Solomon codes over affine spaces and polynomial curves up to radius $\rho\le 1-R-\varepsilon$, with field size $q\ge n\cdot 2^{O(\varepsilon^{-3})}$ for affine spaces and $q\ge n\cdot 2^{O_\ell(\varepsilon^{-3})}$ for degree-$\ell$ curves.

1 / 526다음 →