English
Related papers

Related papers: On super-strong Wilf equivalence classes of permut…

200 papers

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…

Combinatorics · Mathematics 2024-05-31 Moussa Barro , K. Ernest Bognini , Boucaré Kientéga

The strong coupling physics of two dimensional gravity at C=7, 13, 19 is deciphered, by building up on previous works along the same line (for a recent review, of the background material, see hep-th/9408069). It is shown that chirality…

High Energy Physics - Theory · Physics 2009-10-28 Jean-Loup Gervais , Jean-François Roussel

In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate…

Combinatorics · Mathematics 2023-06-22 Monica Anderson , Marika Diepenbroek , Lara Pudwell , Alex Stoll

Given a permutation pattern p and an equivalence relation on permutations, we study the corresponding equivalence classes all of whose members avoid p. Four relations are studied: Conjugacy, order isomorphism, Knuth-equivalence and toric…

Combinatorics · Mathematics 2010-06-01 Henning Ulfarsson

We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…

Number Theory · Mathematics 2025-09-08 Bernd C. Kellner

The notion of a weakly Mal'tsev category, as it was introduced in 2008 by the third author, is a generalization of the classical notion of a Mal'tsev category. It is well-known that a variety of universal algebras is a Mal'tsev category if…

Category Theory · Mathematics 2024-03-15 Nadja Egner , Pierre-Alain Jacqmin , Nelson Martins-Ferreira

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Information Theory · Computer Science 2010-02-15 Kenza Guenda

We consider N=1 supersymmetric U(N) gauge theories with Z_k symmetric tree-level superpotentials W for an adjoint chiral multiplet. We show that (for integer 2N/k) this Z_k symmetry survives in the quantum effective theory as a…

High Energy Physics - Theory · Physics 2009-11-11 Adel Bilal , Steffen Metzger

In 2005 Wolfgang Willems put forward a conjecture proposing a lower bound for the sum of squares of the degrees of the irreducible $p$-Brauer characters of a finite group $G$. We prove this conjecture for the prime $p=2$. For this we rely…

Representation Theory · Mathematics 2020-12-17 Gunter Malle

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

Number Theory · Mathematics 2025-10-31 Bernd C. Kellner

In 2009, Shur published the following conjecture: Let $L$ be a power-free language and let $e(L)\subseteq L$ be the set of words of $L$ that can be extended to a bi-infinite word respecting the given power-freeness. If $u, v \in e(L)$ then…

Formal Languages and Automata Theory · Computer Science 2025-04-29 Josef Rukavicka

We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.

Logic in Computer Science · Computer Science 2015-07-01 Tom Hirschowitz

A frequent topic in the study of pattern avoidance is identifying when two sets of patterns $\Pi, \Pi'$ are Wilf equivalent, that is, when $|\text{Av}_n(\Pi)| = |\text{Av}_n(\Pi')|$ for all $n$. In recent work of Dokos et al. the notion of…

Combinatorics · Mathematics 2019-04-24 Caden Bielawa , Robert Davis , Daniel Greeson , Qinhan Zhou

Fici, Restivo, Silva, and Zamboni define a $k$-antipower to be a word composed of $k$ pairwise distinct, concatenated words of equal length. Berger and Defant conjecture that for any sufficiently well-behaved aperiodic morphic word $w$,…

Combinatorics · Mathematics 2023-06-22 Swapnil Garg

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

Combinatorics · Mathematics 2007-05-23 Irina Gheorghiciuc

Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M-equivalence is proposed as a canonical alternative…

Combinatorics · Mathematics 2015-06-24 Wen Chean Teh

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Formal Languages and Automata Theory · Computer Science 2017-03-16 Lukas Fleischer , Manfred Kufleitner

Let D be a division ring such that the number of conjugacy classes in the multiplicative group D^* is equal to the power of D^*. Suppose that H(V) is the group GL(V) or PGL(V), where V is an infinite-dimensional vector space over D. We…

Logic · Mathematics 2011-12-13 Vladimir Tolstykh

We consider the capability of $p$-groups of class two and odd prime exponent. The question of capability is shown to be equivalent to a statement about vector spaces and linear transformations, and using the equivalence we give proofs of…

Group Theory · Mathematics 2009-01-19 Arturo Magidin
‹ Prev 1 4 5 6 7 8 10 Next ›