Related papers: Automatic Enumeration of Generalized Menage Number…
Rank aggregation is an essential approach for aggregating the preferences of multiple agents. One rule of particular interest is the Kemeny rule, which maximises the number of pairwise agreements between the final ranking and the existing…
Active automata learning from membership and equivalence queries is a foundational problem with numerous applications. We propose a novel variant of the active automata learning problem: actively learn finite automata using preference…
We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…
The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a treasure trove of mathematical information, and, one of its…
In this era of large-scale data, distributed systems built on top of clusters of commodity hardware provide cheap and reliable storage and scalable processing of massive data. Here, we review recent work on developing and implementing…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
We report on a package of routines for the computer algebra system Maple which supports the explicit determination of the geometric quantities, field equations, equations of motion, and conserved quantities of General Relativity in the…
Accurate prediction of continuous properties is essential to many scientific and engineering tasks. Although deep-learning regressors excel with abundant labels, their accuracy deteriorates in data-scarce regimes. We introduce RankRefine, a…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed…
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…
In the last years, enumeration algorithms with bounded delay have attracted a lot of attention for several data management tasks. Given a query and the data, the task is to preprocess the data and then enumerate all the answers to the query…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\"os-R\'enyi random graphs in a random environment. We show that the expected number of…
Using recurrences gotten from the Apagodu-Zeilberger Multivariate Almkvist-Zeilberger algorithm we present a linear-time, and constant-space, algorithm to compute the general mixed moments of the k-variate general normal distribution, with…
This paper analyzes the performance of sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. Precise bounds on the number of samples required to yield an accurate estimate are derived.…
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…