相关论文: Computational techniques for proving identities in…

In mathematics, it is common practice to have several constructions for the same objects. Mathematicians will identify them modulo isomorphism and will not worry later on which construction they use, as theorems proved for one construction…

A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…

This paper concerns the self-similarity of topological spaces, in the sense defined in math.DS/0411344. I show how to recognize self-similar spaces, or more precisely, universal solutions of self-similarity systems. Examples include the…

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

Evaluating joint probabilities of potential outcomes and observed variables, and their linear combinations, is a fundamental challenge in causal inference. This paper addresses the bounding and identification of these probabilities in…

We present algebraic techniques to analyze state space models in the areas of structural identifiability, observability, and indistinguishability. While the emphasis is on surveying existing algebraic tools for studying ODE systems, we also…

A remarkable number of different numerical algorithms can be understood and analyzed using the concepts of symmetric spaces and Lie triple systems, which are well known in differential geometry from the study of spaces of constant curvature…

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such…

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…

In this work we prove a new combinatorial identity and applying it we establish many finite harmonic sum identities. Among many others, we prove that \begin{equation*}…

This version is ***superseded*** by a full version that can be found at http://www.itu.dk/people/pagh/papers/mining-jour.pdf, which contains stronger theoretical results and fixes a mistake in the reporting of experiments. Abstract:…

This paper proposes a new paradigm and computational framework for identification of correspondences between sub-structures of distinct composite systems. For this, we define and investigate a variant of traditional data clustering, termed…

Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…

We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied $\mathbb{Q}S_n$-modules. By using only a handful of simple combinatorial objects (e.g., tabloids) and…

We state and prove a general summation identity. The identity is then applied to derive various summation formulas involving the generalized harmonic numbers and related quantities. Interesting results, mostly new, are obtained for both…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Fusion and inference from multiple and massive disparate data sources - the requirement for our most challenging data analysis problems and the goal of our most ambitious statistical pattern recognition methodologies - -has many and varied…

Identifying independence between two random variables or correlated given their samples has been a fundamental problem in Statistics. However, how to do so in a space-efficient way if the number of states is large is not quite well-studied.…

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…