English
Related papers

Related papers: The Multiple Permutation Problem and Some Conjectu…

200 papers

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

Combinatorics · Mathematics 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…

Combinatorics · Mathematics 2015-02-24 Yiting Li

We provide a combinatorial approach to the largest power of $p$ in the number of permutations $\pi$ with $\pi^p=1$, for a fixed prime number $p$. With this approach, we find the largest power of $2$ in the number of involutions, in the…

Combinatorics · Mathematics 2010-11-03 Dongsu Kim , Jang Soo Kim

For $n=0,1,2,\ldots$ let $W_n=\sum_{k=0}^{[n/3]}\binom{2k}k \binom{3k}k\binom n{3k}(-3)^{n-3k}$, where $[x]$ is the greatest integer not exceeding $x$. Then $\{W_n\}$ is an Ap\'ery-like sequence. In this paper we deduce many congruences…

Number Theory · Mathematics 2020-05-12 Zhi-Hong Sun

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

Combinatorics · Mathematics 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader

We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite $m$-generated Moufang loops of exponent $p^n$.

Rings and Algebras · Mathematics 2020-05-26 Alexander Grishkov , Liudmila Sabinina , Efim Zelmanov

Permutation Pattern Matching (or PPM) is a decision problem whose input is a pair of permutations $\pi$ and $\tau$, represented as sequences of integers, and the task is to determine whether $\tau$ contains a subsequence order-isomorphic to…

Combinatorics · Mathematics 2016-08-02 Vít Jelínek , Jan Kynčl

We examine the complexity of basic regular operations on languages represented by Boolean and alternating finite automata. We get tight upper bounds m+n and m+n+1 for union, intersection, and difference, 2^m+n and 2^m+n+1 for concatenation,…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Galina Jirásková

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

Number Theory · Mathematics 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

Z. Rudnick and P. Sarnak have proved that the pair correlation for the fractional parts of $n^2 \alpha$ is Poissonian for almost all $\alpha$. However, they were not able to find a specific $\alpha$ for which it holds. We show that the…

Number Theory · Mathematics 2009-09-01 Jimi Lee Truelsen

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

Combinatorics · Mathematics 2022-08-04 Ricky X. F. Chen

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

Combinatorics · Mathematics 2017-11-09 Lisa Hui Sun , Mingzhi Zhang

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main (later: 'fundamental') theorem of invariant…

Combinatorics · Mathematics 2015-04-13 Martin Rubey , Bruce W. Westbury

Let $ a_1(x)p_1(x)^n + \cdots + a_k(x)p_k(x)^n $ as well as $ b_1(x)q_1(x)^m + \cdots + b_l(x) q_l(x)^m $ be two polynomial power sums where the complex polynomials $ p_i(x) $ and $ q_j(x) $ are all non-constant. Then in the present paper…

Number Theory · Mathematics 2025-06-05 Sebastian Heintze

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

This paper contains a suite of results concerning the problem of adding $m$ distinct new points to a configuration of $n$ distinct points on the Riemann sphere, such that the new points depend continuously on the old. Altogether, the…

Geometric Topology · Mathematics 2020-12-16 Lei Chen , Nick Salter

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

Number Theory · Mathematics 2021-12-07 Zhi-Hong Sun
‹ Prev 1 4 5 6 7 8 10 Next ›