Related papers: A symbolic method for k-statistics
An umbral calculus over local fields of positive characteristic is developed on the basis of a relation of binomial type satisfied by the Carlitz polynomials. Orthonormal bases in the space of continuous $\mathbb F_q$-linear functions are…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
New theoretical approaches about forecasting stock markets are proposed. A mathematization of the stock market in terms of arithmetical relations is given, where some simple (non-differential, non-fractal) expressions are also suggested as…
The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.
U-statistics are widely used in fields such as economics, machine learning, and statistics. However, while they enjoy desirable statistical properties, they have an obvious drawback in that the computation becomes impractical as the data…
We show that the dynamics of a quantum system can be represented by the dynamics of an underlying classical systems obeying the Hamilton equations of motion. This is achieved by transforming the phase space of dimension $2n$ into a Hilbert…
We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
We describe a method, using periodic points and determinants, for giving alternative expressions for dynamical quantities (including Lyapunov exponents and Hausdorff dimension of invariant sets) associated to analytic hyperbolic systems.…
This paper provides an approach to establishing the calculus method from the concept of mean, i.e., average. This approach is from a statistics perspective and can help calculus learners understand calculus ideas and analyze a function…
The dynamical equation of quantum mechanics are rewritten in form of dynamical equations for the measurable, positive marginal distribution of the shifted, rotated and squeezed quadrature introduced in the so called "symplectic tomography".…
Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
A semantic tableau method, called an argumentation tableau, that enables the derivation of arguments, is proposed. First, the derivation of arguments for standard propositional and predicate logic is addressed. Next, an extension that…
In this paper, we study some properties of Euler polynomials arising from umbral calculus. Finally, we give some interesting identities of Euler polynomials using our results. Recently, Dere and Simsek have studied umbral calculus related…
The $k$-means is one of the most important unsupervised learning techniques in statistics and computer science. The goal is to partition a data set into many clusters, such that observations within clusters are the most homogeneous and…
kStatistics is a package in R that serves as a unified framework for estimating univariate and multivariate cumulants as well as products of univariate and multivariate cumulants of a random sample, using unbiased estimators with minimum…
Clustering categorical data is an integral part of data mining and has attracted much attention recently. In this paper, we present k-histogram, a new efficient algorithm for clustering categorical data. The k-histogram algorithm extends…
A C# implementation of a generalized k-means variant called relational k-means is described here. Relational k-means is a generalization of the well-known k-means clustering method which works for non-Euclidean scenarios as well. The input…
A dynamic sieve method is designed according to the basic sieve method. It mainly refers to the symbolic dynamics theory. By this method, we could connect the prime system with familiar 'Logistic Mapping'. An interesting discovery is that…