Related papers: Encoding algebraic power series
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codeword, but in rare cases fails to return anything. The original…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
For any positive integer n, a new family of periodic functions in power series form and of period n is used to solve in closed form a class of polynomial equation of order n. The n roots are the values of the appropriate function from that…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
The set of formal power series with coefficients in an associative but noncommutative algebra becomes a loop with the substitution product. We initiate the study of this loop by describing certain Lie and Sabinin algebras related to it.…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…
We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…
In this paper we develop a symbolic algorithm to calculate multivariate power series expansions of univariate polynomials over general base rings. We use this to give a complete power series algorithm to calculate the dual intersection…
We express the Segre class of a monomial scheme -- or, more generally, a scheme monomially supported on a set of divisors cutting out complete intersections -- in terms of an integral computed over an associated body in euclidean space. The…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…
The power structure over the Grothendieck (semi)ring of complex quasi-projective varieties constructed by the authors is used to express the generating series of classes of Hilbert schemes of zero-dimensional subschemes on a smooth…
In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…
Let W be a Coxeter group. We show that a certain power series involving a sum over all involutions in W can be expressed in terms of the Poincare series of W. (The case where W is finite is already known,)
Formal Laurent-Puiseux series are important in many branches of mathematics. This paper presents a {\it Mathematica} implementation of algorithms developed by the author for converting between certain classes of functions and their…