Related papers: Computing modular coincidences
Mixture models extend the toolbox of clustering methods available to the data analyst. They allow for an explicit definition of the cluster shapes and structure within a probabilistic framework and exploit estimation and inference…
Many complex engineering systems consist of multiple subsystems that are developed by different teams of engineers. To analyse, simulate and control such complex systems, accurate yet computationally efficient models are required. Modular…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We call a matrix completely mixable if the entries in its columns can be permuted so that all row sums are equal. If it is not completely mixable, we want to determine the smallest maximal and largest minimal row sum attainable. These…
We give an account of Mazur's proof that, for an elliptic curve over $\mathbb{Q}$, if it admits a nonconstant mapping from $X(N)$ defined over the complex numbers $\mathbb{C}$, for some $N$, then it also admits a nonconstant mapping from…
We determine explicit birational models over Q for the modular surfaces parametrising pairs of N-congruent elliptic curves in all cases where this surface is an elliptic surface. In each case we also determine the rank of the Mordell-Weil…
Assume that samples of a filtered version of a function in a shift-invariant space are avalaible. This work deals with the existence of a sampling formula involving these samples and having reconstruction functions with compact support.…
Moment closure methods appear in myriad scientific disciplines in the modelling of complex systems. The goal is to achieve a closed form of a large, usually even infinite, set of coupled differential (or difference) equations. Each equation…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
We discuss two simple but useful observations that allow the construction of modular forms from given ones using invariant theory. The first one deals with elliptic modular forms and their derivatives, and generalizes the Rankin-Cohen…
This paper addresses the problem of adding redundancy to a collection of physical objects so that the overall system is more robust to failures. In contrast to its information counterpart, which can exploit parity to protect multiple…
We compute the rational homology of the moduli stack $\mathcal{M}$ of objects in the derived category of certain smooth complex projective varieties $X$ including toric varieties, flag varieties, curves, surfaces, and some 3- and 4-folds.…
The majority of model-based clustering techniques is based on multivariate Normal models and their variants. In this paper copulas are used for the construction of flexible families of models for clustering applications. The use of copulas…
Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…
Computation of the interleaving distance between persistence modules is a central task in topological data analysis. For $1$-parameter persistence modules, thanks to the isometry theorem, this can be done by computing the bottleneck…
In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…
Recent progress in time-series forecasting has led to rapidly increasing architectural complexity, yet many reported State-of-the-Art gains are statistically fragile or misattributed. We argue that progress requires a shift from model…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…