中文
相关论文

相关论文: Growth rates of permutation classes: from countabl…

200 篇论文

The class Av(1324), of permutations avoiding the pattern 1324, is one of the simplest sets of combinatorial objects to define that has, thus far, failed to reveal its enumerative secrets. By considering certain large subsets of the class,…

组合数学 · 数学 2015-09-07 David Bevan

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

组合数学 · 数学 2025-09-23 Mohamed Omar , Justin M. Troyka

The age of each countable homogeneous permutation forms a Ramsey class. Thus, there are five countably infinite Ramsey classes of permutations.

组合数学 · 数学 2015-03-19 Julia Böttcher , Jan Foniok

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

组合数学 · 数学 2012-02-06 Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Nik Ruškuc , Vincent Vatter

We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…

数论 · 数学 2024-02-01 Maria Bras-Amorós , Mariana Rosas Ribeiro

The conjugacy growth function counts the number of distinct conjugacy classes in a ball of radius $n$. We give a lower bound for the conjugacy growth of certain branch groups, among them the Grigorchuk group. This bound is a function of…

群论 · 数学 2014-12-17 Elisabeth Fink

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

逻辑 · 数学 2007-05-23 Wesley Calvert

We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…

数据结构与算法 · 计算机科学 2026-03-12 Kshitij Gajjar , Neeldhara Misra

We obtain an explicit formula for the number of permutations of [n] that avoid the barred pattern bar{1}43bar{5}2. A curious feature of its counting sequence, 1, 1, 2, 5, 14, 43, 145, 538, 2194,..., is that the displayed terms agree with…

组合数学 · 数学 2011-11-29 David Callan

The main aim of the article is to show, in the absence of the Axiom of Choice, relationships between the following, independent of $\mathbf{ZF}$, statements: "Every countable product of compact metrizable spaces is separable (respectively,…

一般拓扑 · 数学 2021-09-03 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…

元胞自动机与格子气 · 物理学 2015-03-13 Charles D. Brummitt , Eric Rowland

In this survey article we describe some geometric results in the theory of noncommutative rings and, more generally, in the theory of abelian categories. Roughly speaking and by analogy with the commutative situation, the category of graded…

环与代数 · 数学 2007-05-23 J. T. Stafford , M. Van den Bergh

We give an algebraic proof of a class number formula for dihedral extensions of number fields of degree $2q$, where $q$ is any odd integer. Our formula expresses the ratio of class numbers as a ratio of orders of cohomology groups of units…

数论 · 数学 2020-04-15 Luca Caputo , Filippo A. E. Nuccio

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

环与代数 · 数学 2007-05-23 Michael Pinsker

We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…

组合数学 · 数学 2022-03-09 G. Gutierres , R. Mamede , J. L. Santos

This is a survey of methods developed in the last few years to prove results on growth in non-commutative groups. These techniques have their roots in both additive combinatorics and group theory, as well as other fields. We discuss linear…

群论 · 数学 2015-02-12 H. A. Helfgott

Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central…

数论 · 数学 2022-06-17 Lillian B. Pierce

We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…

组合数学 · 数学 2015-03-17 Richard A. Brualdi , Emeric Deutsch

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

数论 · 数学 2025-01-09 Zhiguo Ding , Michael E. Zieve