相关论文: Computational techniques for proving identities in…
Source identities are fundamental identities between multivariable special functions. We give a geometric derivation of rational and trigonometric source identities. We also give a systematic derivation and extension of various determinant…
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…
We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
In the last ten years, the employment of symbolic methods has substantially extended both the theory and the applications of statistics and probability. This survey reviews the development of a symbolic technique arising from classical…
We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.
Successive differences on a sequence of data help to discover some smoothness features of this data. This was one of the main reasons for rewriting the classical interpolation formula in terms of such data differences. The aim of this paper…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
Recursive matrices are ubiquitous in combinatorics, which have been extensively studied. We focus on the study of the sums of $2\times 2$ minors of certain recursive matrices, the alternating sums of their $2\times 2$ minors, and the sums…
Synchronisation classes are an important building block for shared memory concurrent programs. Thus to reason about such programs, it is important to be able to verify the implementation of these synchronisation classes, considering atomic…
Collective Adaptive Systems often consist of many heterogeneous components typically organised in groups. These entities interact with each other by adapting their behaviour to pursue individual or collective goals. In these systems, the…
Spatial omics assays allow for the molecular characterisation of cells in their spatial context. Notably, the two main technological streams, imaging-based and high-throughput sequencing-based, can give rise to very different data…
In this paper, we present an epistemic logic approach to the compositionality of several privacy-related informationhiding/ disclosure properties. The properties considered here are anonymity, privacy, onymity, and identity. Our initial…
A series of formula is presented that are all inspired by the Ramanujan Notebooks [6]. One of them appears in the notebooks II about Zeta(3). That formula inspired others that appeared in 1998, 2006 and 2009 on the author's website and…
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
Pairwise comparisons between alternatives are a well-established tool to decompose decision problems into smaller and more easily tractable sub-problems. However, due to our limited rationality, the subjective preferences expressed by…
Fingerprinting is a well known technique, which is often used in designing Monte Carlo algorithms for verifying identities involving ma- trices, integers and polynomials. The book by Motwani and Raghavan [1] shows how this technique can be…
We present a formula for the trace of any symmetric power of a $n\times n$ matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and…