English
Related papers

Related papers: On the insertion of n-powers

200 papers

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

Group Theory · Mathematics 2007-05-23 Mark Kambites

We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for…

Logic in Computer Science · Computer Science 2016-03-31 Kord Eickmeyer , Michael Elberfeld , Frederik Harwath

The manifold hypothesis suggests that word vectors live on a submanifold within their ambient vector space. We argue that we should, more accurately, expect them to live on a pinched manifold: a singular quotient of a manifold obtained by…

Computation and Language · Computer Science 2020-11-19 Alexander Jakubowski , Milica Gašić , Marcus Zibrowius

We assemble polynomials in a locally cartesian closed category into a tricategory, allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra. Working in the context of natural models of type theory, we prove…

Category Theory · Mathematics 2018-02-06 Steve Awodey , Clive Newstead

In this paper we study standard bases for submodules of a mixed power series and polynomial ring $R[[t_1,\ldots,t_m]][x_1,\ldots,x_n]^s$ respectively of their localization with respect to a $t$-local monomial ordering for a certain class of…

Algebraic Geometry · Mathematics 2016-09-29 Thomas Markwig , Yue Ren , Oliver Wienand

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

Group Theory · Mathematics 2019-08-27 Carmelo Vaccaro

We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials $P_n$ in $n$ variables, all of whose monomials have positive coefficients, such that $P_n$ can be…

Computational Complexity · Computer Science 2025-12-23 Bruno Cavalar , Théo Borém Fabris , Partha Mukhopadhyay , Srikanth Srinivasan , Amir Yehudayoff

We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce…

Artificial Intelligence · Computer Science 2012-06-26 Changsung Kang , Jin Tian

We study modular forms of some congruence subgroups. In this paper, we treat the cases level is 2-power, 3-power or 5. Structures of graded rings and many identities of infinite sum or infinite product are given. Theory of rational (1/3,…

Number Theory · Mathematics 2020-09-01 Suda Tomohiko

We explore the relations between the Boolean Satisfiability Problem with $n$ Boolean variables and the orthogonal group $\mbox{O}(n)$. We show that all $2^n$ possible solutions induce involutions of $\mathbb{R}^n$ that lie in the compact,…

Combinatorics · Mathematics 2023-11-14 Marco Budinich

The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…

Formal Languages and Automata Theory · Computer Science 2014-04-23 Martin Huschenbett , Dietrich Kuske , Georg Zetzsche

Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Ondřej Klíma

This paper presents new results on the identities satisfied by the sylvester and Baxter monoids. We show how to embed these monoids, of any rank strictly greater than 2, into a direct product of copies of the corresponding monoid of rank 2.…

Rings and Algebras · Mathematics 2021-06-03 Alan J. Cain , António Malheiro , Duarte Ribeiro

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Logic · Mathematics 2019-03-28 Olga Kharlampovich , Laura Lopez

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau

The class of all subdirectly irreducible groups belonging to a variety generated by a finite nilpotent group can be axiomatised by a finite set of elementary sentences.

Group Theory · Mathematics 2019-11-27 Joshua Grice

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Combinatorics · Mathematics 2026-05-22 Pierre-Emmanuel Caprace , Justin Vast

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Formal Languages and Automata Theory · Computer Science 2014-04-29 Thomas Place , Marc Zeitoun

We study the free metabelian group $M(2,n)$ of prime power exponent $n$ on two generators by means of invariants $M(2,n)'\to \mathbb{Z}_n$ that we construct from colorings of the squares in the integer grid $\mathbb{R} \times \mathbb{Z}…

Group Theory · Mathematics 2020-03-11 Jonathan Ariel Barmak