English
Related papers

Related papers: Group Actions and Some Combinatorics on Words with…

200 papers

The article $-$ part of a larger thesis which aims to give a detailed description of the generalisation to the category of groups with operators of the classical theory of semisimplicity for modules $-$ presents a straightforward…

Group Theory · Mathematics 2020-12-15 Sebastian Cristian Lesnic

This is the first of a series of papers where we develop a theory of total positivity for loop groups. In this paper, we completely describe the totally nonnegative part of the polynomial loop group GL_n(\R[t,t^{-1}]), and for the formal…

Combinatorics · Mathematics 2009-12-06 Thomas Lam , Pavlo Pylyavskyy

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word has this property,…

Combinatorics · Mathematics 2015-09-18 Adam Borchert , Narad Rampersad

Let a complex algebraic reductive group $\bf G$ act on a complex algebraic manifold $\bf X$. For a $\bf G$-invariant subvariety $\Xi$ of the nilpotent cone $\mathcal{N}(\mathfrak{g}^*)\subset \mathfrak{g}^*$ we define a notion of…

Algebraic Geometry · Mathematics 2023-03-21 Avraham Aizenbud , Dmitry Gourevitch

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

Group Theory · Mathematics 2009-07-21 Olga Kharlampovich , Alexei Miasnikov , Vladimir Remeslennikov , Denis Serbin

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Computational Complexity · Computer Science 2025-12-30 Duaa Abdullah , Jasem Hamoud

A generalized moment map is proposed for arbitrary symplectic actions of compact connected Lie groups on closed symplectic manifolds, in the spirit of the circle -valued maps introduced by D. McDuff in the case of non-Hamiltonian circle…

Symplectic Geometry · Mathematics 2016-09-07 Pierre Sleewaegen

We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…

Logic · Mathematics 2026-03-31 Tommaso Flaminio , Sara Ugolini

In this work we define operator-valued Fourier transforms for suitable integrable elements with respect to the Plancherel weight of a (not necessarily Abelian) locally compact group. Our main result is a generalized version of the Fourier…

Functional Analysis · Mathematics 2009-03-26 Alcides Buss

Recently, Sawin and Wood (arXiv:math/2210.06279) proved a formula for the distribution of a random abelian group $G$ in terms of its $H$-moments $\mathbb{E} [\#\operatorname{Sur}(G,H)]$. We show that properties of Macdonald polynomials…

Combinatorics · Mathematics 2026-01-14 Roger Van Peski

This article presents a convenient approach to Fourier analysis for the investigation of functions and distributions defined in $\mathbb{T}^m \times \mathbb{R}^n$. Our approach involves the utilization of a mixed Fourier transform,…

Analysis of PDEs · Mathematics 2025-02-19 André Pedroso Kowacs

Following a recent paper of Anselmo et al., we consider $m \times n$ rectangular matrices formed from the Fibonacci word, and we show that their balance properties can be solved with a finite automaton. We also generalize the result to…

Number Theory · Mathematics 2026-04-22 Jeffrey Shallit , Ingrid Vukusic

In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…

General Mathematics · Mathematics 2026-01-21 Jasem Hamoud , Duaa Abdullah

In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…

Combinatorics · Mathematics 2010-03-16 Amy Glen , Jacques Justin

A theorem due to D. Bernstein states that Euler characteristic of a hypersurface defined by a polynomial f in (C\{0})^n is equal (upto a sign) to n! times volume of the Newton polyhedron of f. This result is related to algebaric torus…

Algebraic Geometry · Mathematics 2007-05-23 Kiumars Kaveh

Let $X$ be a smooth scheme with an action of a reductive algebraic group $G$ over an algebraically closed field $k$ of characteristic zero. We construct an action of the extended affine Braid group on the $G$-equivariant absolute derived…

Representation Theory · Mathematics 2015-10-27 Sergey Arkhipov , Tina Kanstrup

The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…

Representation Theory · Mathematics 2018-01-31 Arkady Berenstein , Karl Schmidt

We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

Quantum Physics · Physics 2009-04-21 Stephen P. Jordan

In this paper we apply a group action approach to the study of Erd\H os-Falconer type problems in vector spaces over finite fields and use it to obtain non-trivial exponents for the distribution of simplices. We prove that there exists…

Combinatorics · Mathematics 2013-11-20 M. Bennett , D. Hart , A. Iosevich , J. Pakianathan , M. Rudnev