中文
相关论文

相关论文: Fertility Numbers of Consecutive $S_3$ Pattern-Avo…

200 篇论文

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

组合数学 · 数学 2012-06-12 Peter Hegarty

We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…

组合数学 · 数学 2023-07-26 John M. Campbell

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

组合数学 · 数学 2022-01-28 John T. Baldwin

Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9…

离散数学 · 计算机科学 2014-04-29 Joel Ouaknine , James Worrell

We study fibres of the fertility map $\Phi$ from decorated rooted trees to decorated multi-index monomials. For a multi-index $\mathbf{k}$ of weight $-1$, the fibre $\mathcal F_{\mathbf{k}}=\{\,t:\Phi(t)=\xx^{\mathbf{k}}\,\}$ consists of…

组合数学 · 数学 2026-05-08 Zhicheng Zhu , Jingtao Li , Xing Gao

Given a pair of finite posets $A \subseteq P$, the function counting integer-valued order preserving extensions of an order preserving map $\lambda : A\rightarrow \mathbb{Z}$ from $A$ to $P$ is given by a piecewise polynomial in $\lambda$.…

组合数学 · 数学 2026-04-20 Katharina Jochemko , Krishna Menon

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…

组合数学 · 数学 2010-11-15 Andrew Crites

The 3-decomposition conjecture is wide open. It asserts that every finite connected cubic graph can be decomposed into a spanning tree, a disjoint union of cycles, and a matching. We show that every such decomposition is derived from a…

组合数学 · 数学 2022-02-22 Oliver Bachtler , Irene Heinrich

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

泛函分析 · 数学 2022-04-26 Mateo Tomašević

A sign pattern is a matrix that has entries from the set $\{+,-,0\}$. An $n\times n$ sign pattern $\mathcal{P}$ is called consistent if every real matrix in its qualitative class has exactly $k$ real eigenvalues and $n-k$ nonreal…

组合数学 · 数学 2026-01-01 Partha Rana , Sriparna Bandopadhyay

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

数论 · 数学 2025-10-16 Joachim König

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…

数论 · 数学 2012-05-01 Manuel Bello-Hernández , Manuel Benito , Emilio Fernández

The structure of three pattern classes Av(2143, 4321), Av(2143, 4312) and Av(1324, 4312) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams…

组合数学 · 数学 2012-06-15 M. H. Albert , M. D. Atkinson , Robert Brignall

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show…

量子物理 · 物理学 2015-12-22 Alexander Müller-Hermes , David Reeb , Michael M. Wolf

For $p$ and $q$ any two distinct Fermat or Mersenne primes, $m,n,r$ as positive integers and $\mu = \pm 1$ satisfying any diophantine relation, $\mbox{(i)}\; 2^m + \mu = p^nq^r, \mbox{(ii)} \; 2^mp^n + \mu = q^r \mbox{ or } \mbox{(iii)} \;…

数论 · 数学 2025-11-27 Anupam Saxena

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

组合数学 · 数学 2017-06-12 Christian Bean , Anders Claesson , Henning Ulfarsson

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

数论 · 数学 2021-10-26 Ajai Choudhry

We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…

组合数学 · 数学 2019-02-12 Colin Defant

We show that each positive map from B(K) to B(H) with K and H finite dimensional Hilbert spaces is a scalar multiple of a map of the form $Tr - \psi$ with $\psi$ completely positive. This is used to give necessary and sufficient conditions…

算子代数 · 数学 2010-09-30 Erling Størmer