<abstract xmlns="http://www.w3.org/1999/xhtml">

Let <italic>π</italic><italic>n</italic> be a uniformly chosen random permutation on [<italic>n</italic>]. Using an analysis of the probability that two overlapping consecutive <italic>k</italic>-permutations are order isomorphic, we show that the expected number of distinct consecutive patterns of all lengths <italic>k</italic> ∈ {1, 2,…, <italic>n</italic>} in <italic>π</italic><italic>n</italic> is <inline-formula>
<alternatives>
<inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/j_puma-2022-0031_eq_001.png"></inline-graphic>
<math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mrow><mfrac><mrow><msup><mrow><mi>n</mi></mrow><mn>2</mn></msup></mrow><mn>2</mn></mfrac><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mi>o</mi><mrow><mo>(</mo><mn>1</mn><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow></math>
<tex-math>{{{n^2}} \over 2}\left( {1 - o\left( 1 \right)} \right)</tex-math>
</alternatives>
</inline-formula> as <italic>n</italic> → ∞. This exhibits the fact that random permutations pack consecutive patterns near-perfectly.
</abstract>

The expected number of distinct consecutive patterns in a random permutation

<abstract xmlns="http://www.w3.org/1999/xhtml">

In this note, we study the mean length of the longest increasing subsequence of a uniformly sampled involution that avoids the pattern 3412 and another pattern.
</abstract>

Houston, TX 77046, Departments of Mathematics and Engineering

The longest increasing subsequence in involutions avoiding 3412 and another pattern

AHEAD OF PRINT

Volume 30 (2022): Issue 4 (December 2022)

Volume 30 (2022): Issue 3 (October 2022) Special issue dedicated to 70th anniversary of prof. Peter Tallos

Volume 30 (2022): Issue 2 (August 2022)

Volume 30 (2022): Issue 1 (June 2022)

Volume 29 (2020): Issue 1 (December 2020)

Volume 28 (2019): Issue 1 (October 2019)

Volume 27 (2018): Issue 2 (August 2018)

Volume 27 (2018): Issue 1 (July 2018)

Volume 26 (2017): Issue 1 (June 2017)

Volume 25 (2015): Issue 2 (December 2015)

Volume 25 (2015): Issue 1 (September 2015)

Pure Mathematics and Applications

 Pure Mathematics and Applications - section Algebra and Theoretical Computer Science - publishes original high quality articles of international relevance in the two disciplines of algebra and theoretical computer science. Specific topics include (but are not limited to) group and semigroup theory, commutative algebra, computational algebra, poset and lattice theory, linear algebra, theory of automata and formal languages, computational complexity, analysis of algorithms, game theory. In particular, articles in which interactions between algebra and theoretical computer science play a relevant role (i.e. techniques of either discipline are fundamental in obtaining results of the other) will be privileged. As a natural consequence of this fact, one of the disciplines which are more relevant to the journal is discrete mathematics, and more specifically enumerative and algebraic combinatorics, graph theory, discrete tomography, random and exhaustive generation, combinatorial order theory, bioinformatics, matroid theory, combinatorics on words.Papers about high quality applications of combinatorial methods to computer science (especially algorithms, data structures, and criptography), or special issues, completely devoted to a certain contemporary topic of high interest, are also published.  Pure Mathematics and Applications - section Mathematics of Optimization - publishes original research works, surveys, historical and biographical articles primarily on mathematics of optimization. Papers about high quality applications of mathematical methods to decision sciences (especially operations research, economics, games and control theory, actuarial and financial mathematics), or special issues, completely devoted to a certain contemporary topic of high interest are also published.  The journal contains two sections - one devoted to Algebra and Theoretical Computer Science, and second to Mathematics of Optimization. The published articles of the first section focus on algebra and theoretical computer science, with interactions between algebra and theoretical computer science in particular. The second section publishes research works, surveys, historical and biographical articles primarily on mathematics of optimization.  Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process.  Target group  researchers in the fields of algebra and theoretical computer science 

Pure Mathematics and Applications

Volume 30 (2022): Issue 4 (December 2022)

The expected number of distinct consecutive patterns in a random permutation

The longest increasing subsequence in involutions avoiding 3412 and another pattern

Search

All Volumes and Issues in this Journal