Related papers: Algebraization of infinite summation
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
Let $X$ be a variety over a complete nontrivially valued field $K$. We construct an algebraizable formal model for the analytification of $X$ in the case $X$ admits a closed embedding into a toric variety. By algebraizable we mean that the…
Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can…
We introduce an algebraic framework for interacting quantum systems that enables studying complex phenomena, characterized by the coexistence and competition of various broken symmetry states of matter. The approach unveils the hidden unity…
Several methods are used to evaluate finite trigonometric sums. In each case, either the sum had not previously been evaluated, or it had been evaluated, but only by analytic means, e.g., by complex analysis or modular transformation…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
In the realm of invertible symmetry, the topological approach based on classifying spaces dominates the classification of 't Hooft anomalies and symmetry protected topological phases. We explore the alternative algebraic approach based on…
Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…
Notions of computation can be modelled by monads. Algebraic effects offer a characterization of monads in terms of algebraic operations and equational axioms, where operations are basic programming features, such as reading or updating the…
In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a learner is given larger and larger fragments of a structure from…
Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to…
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 this sequel to my previous paper, "Is String Theory in Knots?" I explore ways of constructing symmetries through an algebraic stepping process using knotted graphs. The hope is that this may lead to an algebraic formulation of string…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…
Matthew Baker investigated, in previous work, an elegant, infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an important technique from set theory, or a different technique…
We generalise the Elekes-Szab\'o theorem to arbitrary arity and dimension and characterise the complex algebraic varieties without power saving. The characterisation involves certain algebraic subgroups of commutative algebraic groups…
We define a categorical framework in which we build a systematic construction that provides generic invariants for C*-algebras. The benefit is significant as we show that any invariant arising this way automatically enjoys nice properties…
In a recent paper (Appl. Math. Comput. 215, 1622--1645, 2009), the authors proposed a method of summation of some slowly convergent series. The purpose of this note is to give more theoretical analysis for this transformation, including the…