Related papers: Formal residue and computer proofs of combinatoria…
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
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…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is isomorphic to some algebra over a finite base. This result…
In recent decades, a growing number of discoveries in fields of mathematics have been assisted by computer algorithms, primarily for exploring large parameter spaces that humans would take too long to investigate. As computers and…
This preprint is dedicated to a self contained simple proof of the classical criteria for representability of algebraic functions of several complex variables by radicals. It also contains a criteria for representability of algebroidal…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
We study a family of inhomogeneous Ising chain models along with an equivalent family of nearest neighbour particle systems. By the correspondence between the two families we prove identities of combinatorial significance relating to…
Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…
In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there…
We introduce a method for associating a chain complex to a module over a combinatorial category, such that if the complex is exact then the module has a rational Hilbert series. We prove homology--vanishing theorems for these complexes for…
In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain ad- ditive properties. This result has been generalized in different directions, and our contribution is to provide a further generalization concerning…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
Invariants of generalized tensor fields on a line are classified using special polynomials P_mk^(-1/lambda) introduced here for this purpose. For the case of positive characteristic, a new invariant of formal power series, a width, is…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…