Related papers: Some Remarks on a recent article by J. -P. Allouch…
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.
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved…
In this note, we look at some of the less explored aspects of the gamma function. We provide a new proof of Euler's reflection formula and discuss its significance in the theory of special functions. We also discuss a result of Landau…
Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…
Mulmuley recently gave an explicit version of Noether's Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are deterministic black-box algorithms for polynomial identity…
Pisot sequences (sequences $a_n$ with initial terms $a_0=x, a_1=y$, and defined for $n>1$ by $a_n= \lfloor a_{n-1}^2/a_{n-2} + \frac{1}{2} \rfloor$) often satisfy linear recurrences with constant coefficients that are valid for all $n \geq…
In April 2016, Daniela Frauchiger and Renato Renner published an article online in which they introduce a Gedankenexperiment that led them to conclude that single-world interpretation of quantum theory cannot be self-consistent. In a new…
In 2003, Zudilin presented a $q$-analogue of Euler's identity for one of the variants of $q$-double zeta function. This article focuses on exploring identities related to another variant of $q$-double zeta function and its star variant.…
We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…
We use computer algebra to demonstrate the existence of a multilinear polynomial identity of degree 8 satisfied by the bilinear operation in every Lie-Yamaguti algebra. This identity is a consequence of the defining identities for…
Through a systematic approach on generating Wilf-Zeilberger-pairs, we prove some hypergeometric identities conjectures due to Z.W. Sun, J. Guillera and Y. Zhao etc., including two Ramanujan-$1/\pi^4$, one $1/\pi^3$ formulas as well as a…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
In a Hom-Malcev algebra an identity, equivalent to the Hom-Malcev identity, is found.
We give a rigorous mathematical proof for the validity of the toric sheaf cohomology algorithm conjectured in the recent paper by R. Blumenhagen, B. Jurke, T. Rahn, and H. Roschy (arXiv:1003.5217). We actually prove not only the original…
This paper has two purposes. The first is to explicate the diagrammatic approach to Hopf algebras due to Kuperberg, and to examine his proof of the existence and uniqueness of integrals in both the diagrammatic and purely algebraic…
The main aim of the present paper is to represent an exact and simple proof for FLT by using properties of the algebra identities and linear algebra.
In this work, we propose a theory for information matching. It is motivated by the observation that retrieval is about the relevance matching between two sets of properties (features), namely, the information need representation and…
We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…
We provide bijective proofs of two classic identities that are very simple to prove using generating functions, but surprisingly difficult to prove combinatorially. The problem of finding a bijective proof for the first identity was first…