Related papers: Partition structure and the A-hypergeometric distr…
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…
A central problem in computational statistics is to convert a procedure for sampling combinatorial from an objects into a procedure for counting those objects, and vice versa. Weconsider sampling problems coming from *Gibbs distributions*,…
Given a parametrization of a rational plane algebraic curve C, some explicit adjoint pencils on C are described in terms of determinants. Moreover, some generators of the Rees algebra associated to this parametrization are presented. The…
Even distribution of irregular workload to processing units is crucial for efficient parallelization in many applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as generalized…
We consider ensembles of random polynomials of the form $p(z)=\sum_{j = 1}^N a_j P_j$ where $\{a_j\}$ are independent complex normal random variables and where $\{P_j\}$ are the orthonormal polynomials on the boundary of a bounded simply…
We consider the problem of solving a large-scale system of linear equations in a distributed or federated manner by a taskmaster and a set of machines, each possessing a subset of the equations. We provide a comprehensive comparison of two…
An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…
The normal form theorem, proved in R. Laver, On the left distributive law and the freeness of an algebra of elementary embeddings, Advances in Mathematics 91 (1992), 209-231, for the free algebra $\Cal A$ on one generator $x$ satisfying the…
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…
With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
Simultaneous core partitions are important objects in algebraic combinatorics. Recently there has been interest in studying the distribution of sizes among all $(s,t)$-cores for coprime $s$ and $t$. Zaleski (2017) gave strong evidence that…
In this expository paper we show how one can, in a uniform way, calculate the weight distributions of some well-known binary cyclic codes. The codes are related to certain families of curves, and the weight distributions are related to the…
A holomorphic map from the complex line to a complex projective space is called normal (a. k. a. Brody curve) if it is uniformly continuous from the Euclidean metric to the Fubini--Study metric. The paper contains a survey of known results…
Idealized probability distributions, such as normal or other curves, lie at the root of confirmatory statistical tests. But how well do people understand these idealized curves? In practical terms, does the human visual system allow us to…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
Sample- and computationally-efficient distribution estimation is a fundamental tenet in statistics and machine learning. We present SURF, an algorithm for approximating distributions by piecewise polynomials. SURF is: simple, replacing…
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of…
This paper proposes a new distributed algorithm for solving linear systems associated with a sparse graph under a generalised diagonal dominance assumption. The algorithm runs iteratively on each node of the graph, with low complexities on…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…