Searcharxiv⌕ Search

arXiv subjects

Yota Maeda

Publications and source records attributed to Yota Maeda.

At least 19 recordsLinked to original sources

Concatenated Codes with One Inner Code: Low-Rate Gilbert-Varshamov Asymptotics from Algebraic-Geometric Codes

Constructing codes that attain the Gilbert-Varshamov (GV) bound while admitting efficient encoding and decoding is a fundamental problem in coding theory. We study concatenated codes that reuse a single binary inner code across all outer coordinates. To exploit existing encoding and decoding algorithms, we restrict the outer codes to random subcodes of scaled copies of prescribed algebraic codes and investigate their minimum distance. Our first contribution is a general upper bound on the minimum-distance failure probability that separates two terms controlled by the inner code's bias moments and the dual weight distribution of the prescribed code, together with sufficient conditions for exponential decay. Our second contribution is a concrete construction satisfying these conditions using algebraic-geometric codes from the Garcia-Stichtenoth tower. For every sufficiently small $\varepsilon>0$, we construct a family of random binary codes $C_m$ whose rates approach $\varepsilon^2$ and satisfy \[ \Pr\left[δ(C_m)\geq\frac12-\sqrt{\frac{\ln 2}{2}}\left(\varepsilon+\frac{\varepsilon^3}{2}\right)\right]\geq 1-2^{-c\varepsilon^4N_m}, \] for all sufficiently large $m$, where $N_m$ is the block length and $c>0$ is independent of $\varepsilon$ and $m$. Thus, the distance guarantee matches the leading coefficient of the GV bound at low rates. For each fixed $\varepsilon$, the construction uses a single inner encoding map throughout the family and admits polynomial-time encoding and unique decoding within a guaranteed radius. This answers the question of Doron, Mosheiff, and Wootters for subcodes of scaled algebraic geometry codes at low rates.

cs.IT↗

Asymptotically good codes from Siegel modular varieties

We construct asymptotically good codes by evaluating Siegel modular forms at superspecial points on congruence towers of Siegel modular varieties. For every genus $g\ge2$ and every fixed weight $w\ge g+1$, the construction gives such a family in sufficiently large characteristic, over a finite field which is independent of the level of the tower. The towers can be chosen so that this field is $\mathbb{F}_{p^2}$. We give an explicit lower bound for the asymptotic rate. The lower bound for the relative minimum distance follows from the Pieri formula on the space of flags in the Hodge bundle and an intersection argument along its strata. We also prove that, for $p\ge5$ and $0\le w\le p+1$, the kernel of evaluation in every genus consists precisely of the multiples of the ordinary Hasse invariant. For $g=2,3$, the geometry of the supersingular locus gives explicit bounds for the relative minimum distance and recovery sets whose sizes are bounded independently of the level.

math.NT↗

Polynomial-Time Constructions of Asymptotically Good Random Access Codes from Linear Codes

Random access codes (RACs) encode a $q$-ary input string into fewer $q$-ary symbols while allowing any requested input symbol to be recovered with probability above the random-guessing value $1/q$. However, it remains unclear what asymptotic guarantees on compression and recovery probability should be required of RACs. We address this question by introducing the notion of asymptotically good RACs and give two polynomial-time constructions. First, an $[n,k,d]_q$ linear code with $d\ge2$, together with an encoder based on its orthogonal-array property, yields an $(n,n-k)_q$-RAC with worst-case decoding success probability \[ p_{\rm wc}=\frac{1}{q}+\left(1-\frac{1}{q}\right)\frac{d-2}{n}. \] These OA-RACs are asymptotically good whenever the underlying linear codes are, and Garcia--Stichtenoth algebraic-geometry codes give a concrete polynomial-time realization. Second, a direct-sum strategy using OA-RACs derived from $q$-ary Hamming codes and the trivial $(1,1)_q$-RAC yields asymptotically good RAC families at every prescribed RAC rate $R_{\rm RAC}=(n-k)/n\in(0,1)$. Numerical results demonstrate favorable finite-length performance of both constructions.

cs.IT↗

K-Moduli Wall Crossing and Automorphic Forms for the Moduli Space of Rational Elliptic Surfaces

Using K-moduli spaces for log quasimaps $q_t\colon\left(\mathbb P^1,\frac{1-t}{12}D\right)\to[\mathbb A^2/\mathbb G_m]$ of degree twelve with twelve points and weight $t/12$, we construct a modular interpolation $\{\mathcal M_t\}_{0\le t\le1}$ between the Baily--Borel compactification of the Heckman--Looijenga ball quotient $X_o$ and Miranda's GIT compactification of the moduli space of rational elliptic surfaces. We completely determine the wall-crossing and, for every rational $t\in[0,1]$, identify \[ \mathcal M_t\cong\operatorname{Proj}R\!\left(X_o,\mathcal L+\frac t2Δ(6)+\frac t3Δ(9)\right), \] where $\mathcal L$ is the automorphic $\mathbb Q$-line bundle and $Δ(6),Δ(9)$ are distinguished Heegner divisors. On the automorphic side, we construct a new automorphic form on $X_o$ via a Borcherds product, whose divisor gives an independent relation among the Heegner divisors. This relation provides a key input for determining the birational transformations in the K-moduli wall-crossing. As part of this analysis, we show that the first positive chamber $\mathcal M_t$ for $t\in (0,1/7)$ is Looijenga's semi-toroidal compactification.

math.AG↗

K-moduli wall crossing for quasimaps to a projective variety

We develop a modular wall crossing theory for quasimaps to a projective variety, allowing independent variation of the boundary coefficients and the quasimap weight. Building on the K-stability of quasimaps introduced by Hashizume and the first author, we construct projective moduli spaces in the stable, Calabi--Yau, and log Fano regimes, together with wall crossing morphisms. A central construction is the moduli theory of boundary polarized Calabi--Yau quasimaps, which retains an ample polarization at the numerically trivial locus and allows comparison with suitable perturbations toward the stable and log Fano regions. The stable theory applies in arbitrary genus, while the comparisons through the Calabi--Yau locus concern genus zero. For degree-one boundary divisors, the resulting framework relates weighted stable maps and quasimaps to Hassett spaces and GIT quotients of weighted points on $\mathbb P^1$. In a companion paper, we apply this framework to give a modular interpolation between Miranda's GIT compactification of rational elliptic surfaces and the Baily--Borel compactification of an eight-dimensional ball quotient.

math.AG↗

Singularities of Non-negative Matrix Factorization and their application to Bayesian inference

Non-negative matrix factorization (NMF) is a singular statistical model whose Bayesian asymptotics are governed by the real log canonical threshold (RLCT). We study the local geometry of the factorization map and derive an upper bound for the RLCT of NMF. Let $H$ be the model inner dimension and $H_0$ the non-negative rank of the true $M\times N$ matrix. Assuming that the true matrix admits a strictly positive factorization of inner dimension $H_0$ in the interior of the parameter domain, we prove, for smooth positive priors, that $λ\leq \{(H-H_0)\min(M,N)+H_0(M+N-H_0)\}/2$. This bound strictly improves the previous bound when $H_0\geq3$. The proof uses a local analytic normal form that separates independent linear coordinates from a residual matrix product. When $H=H_0$ also equals the ordinary rank of the true matrix, we obtain the exact value $λ=H_0(M+N-H_0)/2$. Under the standard assumptions of singular learning theory, these results bound the leading coefficients of the expected Bayesian generalization error and the Bayesian free energy.

stat.ML↗

The Kodaira dimension of even-dimensional ball quotients

We prove that, up to scaling, there exist only finitely many isometry classes of Hermitian lattices over $\mathscr{O}_E$ of signature $(1,n)$ that admit ball quotients of non-general type, where $n>12$ is even and $E=\mathbb{Q}(\sqrt{-D})$ for an odd discriminant $-D<-3$. Furthermore, we show that even-dimensional ball quotients, associated with arithmetic subgroups of $\mathrm{U}(1,n)$ defined over $E$, are always of general type if $n > 207$, or $n>12$ and $D>2557$. To establish these results, we construct a nontrivial full-level cusp form of weight $n$ on the $n$-dimensional complex ball. A key ingredient in our proof is the use of Arthur's multiplicity formula from the theory of automorphic representations.

math.AG↗

On the singularities and the Kodaira dimension of unitary Shimura varieties

We study the geometry of Shimura varieties associated with a Hermitian form of signature $(p,q)$ over an imaginary quadratic field $E$, where $2\leq p\leq q$. We prove that when $p\geq w_E$ and $(p,q)\neq(2,2),(2,3)$, where $w_E:=\#\mathscr{O}_E^\times$, there exists a toroidal compactification with at worst canonical singularities. As an application, combining this singularity analysis with Arthur's multiplicity formula, we prove that only finitely many pairs $(p,q)$ satisfying the above conditions and $p+q\equiv1\pmod{w_E}$ give rise to unitary Shimura varieties that are not of general type. Our method also improves the singularity bound of Gritsenko--Hulek--Sankaran (Invent.\ Math., 2007) for $\mathrm{O}^+(2,n)$ to the range $n\geq6$ and shows that this bound is sharp.

math.AG↗

Quantum Algorithms and Hardness for Point-Count Approximation over Finite Fields

We study the approximation of the number of solutions of Laurent polynomials over finite fields. For a Laurent polynomial \[f(x)=\sum_{j=1}^{s}a_jx^{u_j}\in \mathbb{F}_q[x_1^{\pm1},\ldots,x_n^{\pm1}], \] let $U$ be its augmented support matrix whose columns are $(1,u_j)$ with rank $ρ$ and $N(f) := \# \{x\in (\mathbb{F}_q^\times)^n \mid f(x)=0\}$ be its torus point count. Our first main result is a quantum algorithm that outputs $\widehat{N}(f)$ satisfying \[ |\widehat{N}(f) - N(f)| \le \varepsilon q^{n+s/2-ρ} \] with success probability $1-δ$. Provided that $ρ$ and $\|U\|_\infty$ are bounded, the algorithm runs in both classical bit and quantum gate complexity $\mathrm{poly}(n, s, \log q, 1/\varepsilon, \log(1/δ))$. It provides finer resolution than relative-error approximations in general settings. To the best of our knowledge, in the explicit finite-field input model considered here, no previous algorithm achieves this additive accuracy with running time polynomial in $\log q$. Van Dam (arXiv:quant-ph/0405081) conjectured the existence of such an algorithm under the assumption of an oracle reflecting the algebraic properties of the polynomial. In contrast, by exploiting a point-counting formula derived from character sums over finite fields, we develop an alternative approach that efficiently approximates the number of points without assuming the existence of such an oracle. As a second main result, we prove that the same approximation problem becomes $\#$P-hard under randomized polynomial-time Turing reductions when the support matrix $U$ varies freely as part of the input. Thus, taken together, our results clarify how the effectiveness of the quantum approach depends on the tradeoff between the accuracy scale and the support parameters of the input polynomial.

quant-ph↗

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps

A random access code (RAC) encodes an $L$-bit string into a $k$-bit message, $L>k$, so that any requested bit can be recovered with high probability; a quantum RAC (QRAC) uses $k$ qubits instead. We give a geometric characterization of optimal classical $(L,k)$-RACs under average and worst-case decoding criteria. The average criterion is reduced to choosing $2^k$ representatives in $\{0,1\}^L$, while the worst-case criterion is reduced to a minimax problem over $2^k$ points in $[0,1]^L$ with a distance-like objective. This framework proves optimality for several parameter families, with many optimal constructions arising from standard infinite families of binary linear codes. It also yields two explicit classical--quantum separations. First, for every $L>1$, we construct a $(L,1)$-QRAC whose average decoding success probability strictly exceeds the optimal classical value. Second, for the family $(2^k-1,k)$, we prove worst-case optimality of a classical RAC and construct a QRAC with strictly larger worst-case success probability. For the family $(L,L-1)$, the framework identifies a classical RAC that is average-case optimal and, under a stated conjecture, also worst-case optimal. The same viewpoint further recovers explicit $(L,L-1)$-QRACs attaining a previously conjectured upper-bound value.

quant-ph↗

Compactifications of the Eisenstein ancestral Deligne-Mostow variety

All arithmetic non-compact ball quotients by Deligne-Mostow's unitary monodromy group arise as sub-ball quotients of either of two spaces called ancestral cases, corresponding to Gaussian or Eisenstein Hermitian forms respectively. In a previous paper, we investigated the compactifications of the Gaussian Deligne-Mostow variety. Here we work on the remaining case, namely the ring of Eisenstein integers. This variety is related to the moduli space of unordered 12 points on $\mathbb{P}^1$. In particular, we show that Kirwan's partial resolution of the moduli space is not a semi-toroidal compactification and Deligne-Mostow's period map does not lift to the unique toroidal compactification. We give two interpretations of these phenomena in terms of the log minimal model program and automorphic forms. As an application, we prove that the above two compactifications are not (stacky) derived equivalent, as the $DK$-conjecture predicts. Furthermore, we construct an automorphic form on the moduli space of non-hyperelliptic curves of genus 4, which is isogenous to the Eisenstein Deligne-Mostow variety, giving another intrinsic proof, independent of lattice embeddings, of a result by Casalaina-Martin, Jensen and Laza.

math.AG↗

Remarks on two problems by Hassett

One of the ultimate goals of the Hassett-Keel program is the determination of the log canonical models of the moduli spaces of pointed rational curves $\overline{M}_{0,n}$. In this paper, we study log canonical models of $\overline{M}_{0,5}$ with \textit{asymmetric} boundary divisors. Our results generalize previous work by Alexeev-Swinarski, Fedorchuk-Smyth, Kiem-Moon and Simpson for the first non-trivial case, namely $n=5$. We prove that all moduli spaces of weighted pointed rational curves $\overline{M}_{0,A}$ arise as log canonical models of $\overline{M}_{0,5}$ for suitable choices of boundary coefficients, thereby also recovering a theorem of Fedorchuk and Moon. In addition, we relate these moduli spaces to Deligne-Mostow ball quotients. We further study log canonical models of the moduli spaces $\overline{M}_{0,n\cdot (1/k)}$ with symmetric weight, which differ from $\overline{M}_{0,n}$. The case $n=5$ can be viewed as an explicit guiding example in a very general program and the paper can thus also serve as an expository introduction.

math.AG↗

Quantum-enhanced causal discovery for a small number of samples

The discovery of causal relations from observed data has attracted significant interest from disciplines such as economics, social sciences, and biology. In practical applications, considerable knowledge of the underlying systems is often unavailable, and real data are usually associated with nonlinear causal structures, which makes the direct use of most conventional causality analysis methods difficult. This study proposes a novel quantum Peter-Clark (qPC) algorithm for causal discovery that does not require any assumptions about the underlying model structures. Based on conditional independence tests in a class of reproducing kernel Hilbert spaces characterized by quantum circuits, the proposed algorithm can explore causal relations from the observed data drawn from arbitrary distributions. We conducted systematic experiments on fundamental graphs of causal structures, demonstrating that the qPC algorithm exhibits better performance, particularly with smaller sample sizes compared to its classical counterpart. Furthermore, we proposed a novel optimization approach based on Kernel Target Alignment (KTA) for determining hyperparameters of quantum kernels. This method effectively reduced the risk of false positives in causal discovery, enabling more reliable inference. Our theoretical and experimental results demonstrate that the quantum algorithm can empower classical algorithms for accurate inference in causal discovery, supporting them in regimes where classical algorithms typically fail. In addition, the effectiveness of this method was validated using the datasets on Boston housing prices, heart disease, and biological signaling systems as real-world applications. These findings highlight the potential of quantum-based causal discovery methods in addressing practical challenges, particularly in small-sample scenarios, where traditional approaches have shown significant limitations.

quant-ph↗

The Universe of Deligne-Mostow Varieties

Deligne and Mostow investigated period maps on the configuration spaces $M_{0,n}$ of $n$ ordered points on $\mathbb{P}^1$. The images of these maps are open subsets of certain ball quotients. Moreover, they extend to isomorphisms between GIT-quotients and the Baily-Borel compactifications. Building on a theorem of Gallardo, Kerr and Schaffler, the period maps lift to isomorphisms between two natural compactifications, namely the Kirwan blow-up and the toroidal compactification. In this paper, we look at the more general situation where we also allow unordered or partially ordered $n$-tuples. Our main result is an easily verifiable criterion that, in this broader setting, determines when the Deligne-Mostow period maps still lift to isomorphisms between the Kirwan blow-up and the toroidal compactification. We further investigate a partial ordering among Deligne-Mostow varieties, which reduces this problem to considering minimal or maximal Deligne-Mostow varieties with respect to this partial ordering. As a byproduct, we prove that, in general, Kirwan's resolution pair is not a log canonical log minimal model and not log $K$-equivalent to the unique toroidal compactification.

math.AG↗

Finiteness of Free Algebras of Modular Forms on Unitary Groups

Classical results on the classification of reflections in an arithmetic subgroup $Γ$ imply that if the graded algebra of modular forms $M_*(Γ)$ is freely generated, then $Γ$ must be an arithmetic subgroup of either the orthogonal group $\operatorname{O}^+(2,n)$ or the unitary group $\operatorname{U}(1,n)$. Vinberg and Schwarzman showed that in the orthogonal case, if $n>10$, then it is never free. In this paper, we investigate the remaining unitary case and prove that, up to scaling, there are only finitely many isometry classes of Hermitian lattices of signature $(1, n)$ with $n > 2$ over imaginary quadratic fields with odd discriminant that admit a free algebra of modular forms. In particular, when $n>99$ (except over $\mathbb{Q}(\sqrt{-3})$, where we require $n > 154$), the graded algebra $M_*(Γ)$ is never free for any arithmetic subgroup $Γ<\operatorname{U}(1,n)$, thereby partially confirming a conjecture by Wang and Williams. As a byproduct, we also establish a finiteness result for reflective modular forms. In the course of this proof, we derive a formula for the covolume of an arithmetic subgroup of a special unitary group, presented as the stabiliser of a Hermitian lattice, which generalises Prasad's volume formula for principal arithmetic subgroups in the case of special unitary groups.

math.NT↗

Geometric Generality of Transformer-Based Gröbner Basis Computation

The intersection of deep learning and symbolic mathematics has seen rapid progress in recent years, exemplified by the work of Lample and Charton. They demonstrated that effective training of machine learning models for solving mathematical problems critically depends on high-quality, domain-specific datasets. In this paper, we address the computation of Gröbner basis using Transformers. While a dataset generation method tailored to Transformer-based Gröbner basis computation has previously been proposed, it lacked theoretical guarantees regarding the generality or quality of the generated datasets. In this work, we prove that datasets generated by the previously proposed algorithm are sufficiently general, enabling one to ensure that Transformers can learn a sufficiently diverse range of Gröbner bases. Moreover, we propose an extended and generalized algorithm to systematically construct datasets of ideal generators, further enhancing the training effectiveness of Transformer. Our results provide a rigorous geometric foundation for Transformers to address a mathematical problem, which is an answer to Lample and Charton's idea of training on diverse or representative inputs.

cs.LG↗

MambaPEFT: Exploring Parameter-Efficient Fine-Tuning for Mamba

An ecosystem of Transformer-based models has been established by building large models with extensive data. Parameter-efficient fine-tuning (PEFT) is a crucial technology for deploying these models to downstream tasks with minimal cost while achieving effective performance. Recently, Mamba, a State Space Model (SSM)-based model, has attracted attention as a potential alternative to Transformers. While many large-scale Mamba-based models have been proposed, efficiently adapting pre-trained Mamba-based models to downstream tasks remains unexplored. In this paper, we conduct an exploratory analysis of PEFT methods for Mamba. We investigate the effectiveness of existing PEFT methods for Transformers when applied to Mamba. We also modify these methods to better align with the Mamba architecture. Additionally, we propose new Mamba-specific PEFT methods that leverage the distinctive structure of Mamba. Our experiments indicate that PEFT performs more effectively for Mamba than Transformers. Lastly, we demonstrate how to effectively combine multiple PEFT methods and provide a framework that outperforms previous works. To ensure reproducibility, we will release the code after publication.

cs.CL↗

Revisiting the moduli space of 8 points on $\mathbb{P}^1$

The moduli space of $8$ points on $\mathbb{P}^1$, a so-called ancestral Deligne-Mostow space, is, by work of Kondō, also a moduli space of K3 surfaces. We prove that the Deligne-Mostow isomorphism does not lift to a morphism between the Kirwan blow-up of the GIT quotient and the unique toroidal compactification of the corresponding ball quotient. Moreover, we show that these spaces are not $K$-equivalent, even though they are natural blow-ups at the unique cusps and have the same cohomology. This is analogous to the work of Casalaina-Martin-Grushevsky-Hulek-Laza on the moduli space of cubic surfaces. The moduli spaces of ordinary stable maps, that is, the Fulton-MacPherson compactification of the configuration space of points on $\mathbb{P}^1$, play an important role in the proof. We further relate our computations to new developments in the minimal model program and recent work of Odaka. We briefly discuss other cases of moduli space of points on $\mathbb{P}^1$ where a similar behaviour can be observed, hinting at a more general, but not yet fully understood phenomenon.

math.AG↗