English
Related papers

Related papers: Free polynomial strong bimonoids

200 papers

Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state. Their behaviours can be formalized either as weighted language equivalence or…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Purandar Bhaduri

We construct easy embeddings of relatively free groups (say the free Burnside group, the free solvable group) into finitely presented groups. We introduce a concept of verbal isoperimetric function of a group variety. We prove that if the…

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii , M. V. Sapir

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · Mathematics 2008-02-03 David Eisenbud , Bernd Sturmfels

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…

Logic · Mathematics 2023-02-02 Nick Galatos , Adam Přenosil

A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…

Formal Languages and Automata Theory · Computer Science 2023-10-02 Peter Kostolányi

We provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…

Rings and Algebras · Mathematics 2025-12-16 Ganna Kudryavtseva , Ajda Lemut Furlani

Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…

Combinatorics · Mathematics 2015-11-13 Trygve Johnsen , Jan Roksvold , Hugues Verdure

Given a Banach space $X$ and $d\in \mathbb{N}$, we construct a metric space $\mathbb{V}_X^d$ with the property that every $d$-homogeneous polynomial defined on $X$ factors through a Lipschitz map on it. We prove that the metric on…

Functional Analysis · Mathematics 2024-12-17 Maite Fernández-Unzueta

We give a sufficient condition for a bi-invariant weight on a Frobenius bimodule to satisfy the extension property. This condition applies to bi-invariant weights on a finite Frobenius ring as a special case. The complex-valued functions on…

Rings and Algebras · Mathematics 2020-08-26 Oliver W. Gnilke , Marcus Greferath , Thomas Honold , Jay A. Wood , Jens Zumbrägel

Following Britz, Johnsen, Mayhew and Shiromoto, we consider demi\-ma\-troids as a(nother) natural generalization of matroids. As they have shown, demi\-ma\-troids are the appropriate combinatorial objects for studying Wei's duality. Our…

Combinatorics · Mathematics 2019-07-24 Jose Martinez-Bernal , Miguel A. Valencia-Bucio , Rafael H. Villarreal

We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…

Combinatorics · Mathematics 2024-04-17 Vincent Beck , Cédric Lecouvey

The present paper is devoted to the study of dimonoids, algebraic structures with two associative binary operations that satisfy a prescribed system of axioms. We investigate the properties of dual dimonoids. In the class of noncommutative…

Group Theory · Mathematics 2025-10-29 Volodymyr Gavrylkiv

For sets $A, B\subset \mathbb N$, their sumset is $A + B := \{a+b: a\in A, b\in B\}$. If we cannot write a set $C$ as $C = A+B$ with $|A|, |B|\geq 2$, then we say that $C$ is $\textit{irreducible}$. The question of whether a given set $C$…

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

Rings and Algebras · Mathematics 2011-12-07 Adam Chapman

Suppose that $X\_{1}$ and $X\_{2}$ are two selfadjoint random variables that are freely independent over an operator algebra $\mathcal{B}$. We describe the possible operator atoms of the distribution of $X\_{1}+X\_{2}$ and, using…

Operator Algebras · Mathematics 2020-05-18 Serban Belinschi , Hari Bercovici , Weihua Liu

We have shown recently that, given a metric space $X$, the coarse equivalence classes of metrics on the two copies of $X$ form an inverse semigroup $M(X)$. Here we study the property of idempotents in $M(X)$ of being finite or infinite,…

Metric Geometry · Mathematics 2021-03-09 V. Manuilov

Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Manfred Droste , Werner Kuich

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…

Group Theory · Mathematics 2010-12-13 Sang-hyun Kim , Henry Wilton

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

Rings and Algebras · Mathematics 2008-10-31 Mark Kambites