Related papers: A database of rigorous Maass forms

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

Based on the notion of strong modular form developed in Part I, we propose to structure the family of cuspidal modular form spaces $(S_{2k}(\Gamma_0(N)))_{k\in \mathbb{N}^*}$ and to determine bases for each of these spaces, once known bases…

Calibration of computer models is a key step in making inferences, predictions, and decisions for complex science and engineering systems. We formulate and analyze a nonparametric Bayesian methodology for computer model calibration. This…

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

The structural characterization of high-dimensional mutually unbiased bases (MUBs) by classifying MUBs subsets remains a major open problem. The existing methods not only fail to conclude on the exact classification, but also are severely…

In this article, we introduce a new parameterized family of topological descriptors, taking the form of candidate decompositions, for multi-parameter persistence modules, and we identify a subfamily of these descriptors, that we call…

In this manuscript a unified framework for conducting inference on complex aggregated data in high dimensional settings is proposed. The data are assumed to be a collection of multiple non-Gaussian realizations with underlying undirected…

Machine learning techniques typically rely on large datasets to create accurate classifiers. However, there are situations when data is scarce and expensive to acquire. This is the case of studies that rely on state-of-the-art computational…

We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…

Graphical modeling explores dependences among a collection of variables by inferring a graph that encodes pairwise conditional independences. For jointly Gaussian variables, this translates into detecting the support of the precision…

Gamma uncertainty sets have been introduced for adjusting the degree of conservatism of robust counterparts of (discrete) linear programs. The contribution of this paper is a generalization of this approach to (mixed integer) nonlinear…

Multi-model databases are designed to store, manage, and query data in various models, such as relational, hierarchical, and graph data, simultaneously. In this paper, we provide a theoretical basis for querying categorical databases. We…

We describe how the loop group maps corresponding to special submanifolds associated to integrable systems may be thought of as certain Grassmann submanifolds of infinite dimensional homogeneous spaces. In general, the associated families…

We propose a generic numerical measure of the inconsistency of a database with respect to a set of integrity constraints. It is based on an abstract repair semantics. In particular, an inconsistency measure associated to cardinality-repairs…

The demanding requirements of the new Big Data intensive era raised the need for flexible storage systems capable of handling huge volumes of unstructured data and of tackling the challenges that traditional databases were facing. NoSQL…

We report on a database of field extensions of the rationals, its properties and the methods used to compute it. At the moment the database encompasses roughly 100,000 polynomials generating distinct number fields over the rationals, of…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We present a randomized approximation algorithm for counting contingency tables, mxn non-negative integer matrices with given row sums R=(r_1, ..., r_m) and column sums C=(c_1, ..., c_n). We define smooth margins (R,C) in terms of the…

We present basics of the gauged superfield approach to constructing N-superconformal multi-particle Calogero-type systems developed in arXiv:0812.4276, arXiv:0905.4951 and arXiv:0912.3508. This approach is illustrated by the multi-particle…

The fusion rules and braiding statistics of anyons in $(2+1)$D fermionic topological orders are characterized by the modular data of a super-modular category. On the other hand, the modular data of a super-modular category form a congruence…