Related papers: Poisson Deleting Derivations Algorithm and Poisson…
Estimating the rank of a corrupted data matrix is an important task in data analysis, most notably for choosing the number of components in PCA. Significant progress on this task was achieved using random matrix theory by characterizing the…
We introduce a new class of algebras called Poisson orders. This class includes the symplectic reflection algebras of Etingof and Ginzburg, many quantum groups at roots of unity, and enveloping algebras of restricted Lie algebras in…
We consider the problem of choosing between parametric models for a discrete observable, taking a Bayesian approach in which the within-model prior distributions are allowed to be improper. In order to avoid the ambiguity in the marginal…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general…
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…
We introduce the Poisson tensor completion (PTC) estimator that exploits inter-sample relationships to compute a low-rank Poisson tensor decomposition of the frequency histogram for samples of a multivariate distribution. Our crucial…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
As a powerful tool for longitudinal data analysis, the generalized estimating equations have been widely studied in the academic community. However, in large-scale settings, this approach faces pronounced computational and storage…
We introduce a new type of algebra, the Courant-Dorfman algebra. These are to Courant algebroids what Lie-Rinehart algebras are to Lie algebroids, or Poisson algebras to Poisson manifolds. We work with arbitrary rings and modules, without…
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term…
We give a construction of a Poisson transform mapping density valued differential forms on generalized flag manifolds to differential forms on the corresponding Riemannian symmetric spaces, which can be described entirely in terms of finite…
We study a class of integrable nonhomogeneous Lotka-Volterra systems whose quadratic terms are defined by an antisymmetric matrix and whose linear terms consist of three blocks. We provide the Poisson algebra of their Darboux polynomials,…
For a complex algebraic torus $\mathbb{T}$, we study $\mathbb{T}$-invariant Poisson deformations of a $\mathbb{T}$-log-symplectic log-canonical Poisson structure $\pi_0$ on $\mathbb{C}^n$. We show that every $\mathbb{T}$-invariant…
A new class of Poisson algebras, the class of {\em generalized Weyl Poisson algebras}, is introduced. It can be seen as Poisson algebra analogue of generalized Weyl algebras or as giving a Poisson structure to (certain) generalized Weyl…
We present a simple and accurate method to constrain galaxy bias based on the distribution of counts in cells. The most unique feature of our technique is that it is applicable to non-linear scales, where both dark matter statistics and the…
A molecule is a nonzero non-unit element of an integral domain (resp., commutative cancellative monoid) having a unique factorization into irreducibles (resp., atoms). Here we study the molecules of Puiseux monoids as well as the molecules…
We construct an analogue of Dirac's reduction for an arbitrary local or non-local Poisson bracket in the general setup of non-local Poisson vertex algebras. This leads to Dirac's reduction of an arbitrary non-local Poisson structure. We…
This paper analyzes the circumstances under which Bayesian networks can be pruned in order to reduce computational complexity without altering the computation for variables of interest. Given a problem instance which consists of a query and…
Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of…