Related papers: On properties of composites and monoid domains
Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…
We observe algebraic derivations on an affine domain B defined over an algebraically closed field of characteristic 0, which are called locally finite derivations in commutative and non-commutative contexts in other references. We observe…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…
In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…
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…
In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
Let A be a finitely generated commutative algebra over a field K with a presentation A=K < X_{1}, ..., X_{n} | R >, where R is a set of monomial relations in the generators X_{1}, ..., X_{n}. So A = K[S], the semigroup algebra of the monoid…
Combinatorial and topological aspects of monoids with an absorbing element and their associated algebras are considered. Phd thesis.
We consider certain modules of the symmetric groups whose basis elements are called tabloids. Some of these modules are isomorphic to subspaces of the cohomology rings of subvarieties of flag varieties as modules of the symmetric groups. We…
We introduce a canonical structure of a commutative associative filtered algebra with the unit on polynomial smooth valuations, and study its properties. The induced structure on the subalgebra of translation invariant smooth valuations has…
We know that for a finite field $F$, every function on $F$ can be given by a polynomial with coefficients in $F$. What about the converse? i.e. if $R$ is a ring (not necessarily commutative or with unity) such that every function on $R$ can…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
Motivated by the combinatorial properties of products in Lie algebras, we investigate the subset of permutations that naturally appears when we write the long commutator $[x_1, x_2, ..., x_m]$ as a sum of associative monomials. We…