相关论文: A unifying framework for $k$-statistics, polykays …
We study some combinatorial and algebraic properties of certain quadratic algebras related with dynamical classical and classical Yang-Baxter equations. One can find more details about the content of present paper in Extended Abstract.
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…
We unify parastatistics, defined as triple operator algebras represented on Fock space, in a simple way using the transition number operators. We express them as a normal ordered expansion of creation and annihilation operators. We discuss…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
Marshall and Olkin (1997, Biometrika, 84, 641 - 652) introduced a very powerful method to introduce an additional parameter to a class of continuous distribution functions and hence it brings more flexibility to the model. They have…
This paper deals with the clustering of univariate observations: given a set of observations coming from $K$ possible clusters, one has to estimate the cluster means. We propose an algorithm based on the minimization of the "KP" criterion…
We consider the k-th order statistic from unit exponential distribution and show that it can be represented as a sum of independent exponential random variables. Our proof is simple and different. It readily proves that the standardized…
We consider Vinberg $\theta$-groups associated to a cyclic quiver on $k$ nodes. Let $K$ be the product of the general linear groups associated to each node. Then $K$ acts naturally on $\oplus \text{Hom}(V_i, V_{i+1})$ and by Vinberg's…
The goal of this article is to establish tauberian theorems for the $k$--summability processes defined by germs of analytic functions in several complex variables. The proofs are based on the tauberian theorems for $k$--summability in one…
In this paper we first present summation formulas for $k$-order Eulerian polynomials and $1/k$-Eulerian polynomials. We then present combinatorial expansions of $(c(x)D)^n$ in terms of inversion sequences as well as $k$-Young tableaux,…
In order to tackle parameter estimation of photocounting distributions, polykays of acting intensities are proposed as a new tool for computing photon statistics. As unbiased estimators of cumulants, polykays are computationally feasible…
Log-linear models provide a statistically sound framework for Stochastic ``Unification-Based'' Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters…
We give a new characterization of the peak subalgebra of the algebra of quasisymmetric functions and use this to construct a new basis for this subalgebra. As an application of these results we obtain a combinatorial formula for the…
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…
Kostka-Foulkes polynomials are Lusztig's $q$-analogues of weight multiplicities for irreducible representations of semisimple Lie algebras. It has long been known that these polynomials have non-negative coefficients. A statistic on…
An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
Let $H_k = 1 + 1/2 + 1/3 + \cdots + 1/k$ denote the $k$th harmonic number. We present an easy-to-implement algorithm for the computation of explicit closed-form evaluations, in terms of the digamma and polygamma functions, for Euler sums of…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…