Related papers: Machine-Learning the Sato--Tate Conjecture
In this paper we propose conjectures that assert that, the sequence of Frobenius angles of a given elliptic curve over $\mathbf{Q}$ without complex multiplication is pseudorandom, in other words that the Frobenius angles are statistically…
In part \textit{I} we proposed a structure for a general Hypotheses Space $\mathcal{H}$, the Learning Space $\mathbb{L}(\mathcal{H})$, which can be employed to avoid \textit{overfitting} when estimating in a complex space with relative…
We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…
Classifiers are biased when trained on biased datasets. As a remedy, we propose Learning to Split (ls), an algorithm for automatic bias detection. Given a dataset with input-label pairs, ls learns to split this dataset so that predictors…
We apply machine-learning to the study of dessins d'enfants. Specifically, we investigate a class of dessins which reside at the intersection of the investigations of modular subgroups, Seiberg-Witten curves and extremal elliptic K3…
Large language models display remarkable capabilities in logical and mathematical reasoning, allowing them to solve complex tasks. Interestingly, these abilities emerge in networks trained on the simple task of next-token prediction. In…
This article presents a comprehensive data-scientific investigation into the arithmetic statistics of congruent number elliptic curves, leveraging a dataset of square-free integers up to $3$ million. We analyze the Mordell-Weil ranks,…
In this article, we propose to use the character theory of compact Lie groups and their orthogonality relations for the study of Frobenius distribution and Sato-Tate groups. The results show the advantages of this new approach in several…
We study classifiers operating under severe classification time constraints, corresponding to 1-1000 CPU microseconds, using Convolutional Tables Ensemble (CTE), an inherently fast architecture for object category recognition. The…
Across a wide array of disciplines, many researchers use machine learning (ML) algorithms to identify a subgroup of individuals who are likely to benefit from a treatment the most (``exceptional responders'') or those who are harmed by it.…
Let $A$ be an abelian variety defined over a number field and let $G$ denote its Sato-Tate group. Under the assumption of certain standard conjectures on $L$-functions attached to the irreducible representations of $G$, we study the…
Time-series classification is an important problem for the data mining community due to the wide range of application domains involving time-series data. A recent paradigm, called shapelets, represents patterns that are highly predictive…
We provide new results for noise-tolerant and sample-efficient learning algorithms under $s$-concave distributions. The new class of $s$-concave distributions is a broad and natural generalization of log-concavity, and includes many…
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
We develop a graph-theoretic algorithm to compute the $\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\mathbb{Q}(i)$, where $b \in \mathbb{Z}[i]$ and $\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a…
A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…
We study the distribution of a subclass congruent elliptic curve $E^{(n)}: y^2=x^3-n^2x$, where $n$ is congruent to $1\pmod 8$ with all prime factors congruent to $1\pmod 4$. We prove an independence of residue symbol property. Consequently…
This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…
Recent work of Burungale-Skinner-Tian-Wan established the first infinite families of quadratic twists of non-CM elliptic curves over $\mathbb{Q}$ for which the strong Birch-Swinnerton-Dyer (BSD) conjecture holds. Building on their results,…
The present paper, which is partially a review, but also contains several completely new results, aims at presenting, in a unified mathematical framework, a complex and articulated lore regarding non-compact symmetric spaces, with negative…