相关论文: A unifying framework for $k$-statistics, polykays …

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Ptak on linear-algebraic characterizations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies…

We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial…

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on…

In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…

We study the Euler-Frobenius numbers, a generalization of the Eulerian numbers, and the probability distribution obtained by normalizing them. This distribution can be obtained by rounding a sum of independent uniform random variables; this…

The paper introduces a Bayesian estimation method for quantile regression in univariate ordinal models. Two algorithms are presented that utilize the latent variable inferential framework of Albert and Chib (1993) and the normal-exponential…

We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…

Motivated by applications in redistricting, we consider the uniform capacitated k-median and uniform capacitated k-means problems in bounded doubling metrics. We provide the first QPTAS for both problems and the first PTAS for the uniform…

These pages contain a short overview on the state of the art of efficient numerical analysis methods that solve systems of multivariate polynomial equations. We focus on the work of Steve Smale who initiated this research framework, and on…

In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…

By using a symbolic technique known in the literature as the classical umbral calculus, we characterize two classes of polynomials related to L\'evy processes: the Kailath-Segall and the time-space harmonic polynomials. We provide the…

We discuss umbral calculus as a method of systematically discretizing linear differential equations while preserving their point symmetries as well as generalized symmetries. The method is then applied to the Schr\"{o}dinger equation in…

In this short expository note, we describe a unified algorithmic perspective on several classical problems which have traditionally been studied in different communities. This perspective views the main characters -- the problems of Optimal…

A novel sequential inferential method for Bayesian dynamic generalised linear models is presented, addressing both univariate and multivariate $k$-parametric exponential families. It efficiently handles diverse responses, including…

Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…

In this paper, we investigate the power of nearly purely operational techniques in the study of umbral calculus. We present a concise reconstruction of the theory based on a systematic use of linear operators, with particular attention to…

We give several equivalent combinatorial descriptions of the space of states for the box-ball systems, and connect certain partition functions for these models with the q-weight multiplicities of the tensor product of the fundamental…

By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…