English
Related papers

Related papers: Fertility Numbers of Consecutive $S_3$ Pattern-Avo…

200 papers

A permutation is said to be cycle-alternating if it has no cycle double rises, cycle double falls or fixed points; thus each index $i$ is either a cycle valley ($\sigma^{-1}(i)>i<\sigma(i)$) or a cycle peak ($\sigma^{-1}(i)<i>\sigma(i)$).…

Combinatorics · Mathematics 2024-12-16 Bishal Deb , Alan D. Sokal

We prove in this article the surjectivity of three maps. We prove in Theorem $1.6$ the surjectivity of the Chinese remainder reduction map associated to the projective space of an ideal with a given factorization into ideals whose radicals…

Number Theory · Mathematics 2020-05-20 C. P. Anil Kumar

In this paper we find and classify all patterns for a single locus three- and four-allele population genetics models in continuous time. A pattern for a $k$-allele model means all coexisting locally stable equilibria with respect to the…

Populations and Evolution · Quantitative Biology 2011-08-26 Linlin Su , Colbert Sesanker , Roger Lui

We study stable subspaces of positive extremal maps of finite dimensional matrix algebras that preserve trace and matrix identity (so-called bistochastic maps). We have established the existence of the isometric-sweeping decomposition for…

Quantum Physics · Physics 2015-08-18 Marek Miller , Robert Olkiewicz

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

This paper completes a project to enumerate permutations avoiding a triple T of 4-letter patterns, in the sense of classical pattern avoidance, for every T. There are 317 symmetry classes of such triples T and previous papers have…

Combinatorics · Mathematics 2017-11-23 David Callan , Toufik Mansour , Mark Shattuck

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Combinatorics · Mathematics 2025-05-28 Atli Fannar Franklín

In this work of thesis we introduce and study a new family of sorting devices, which we call pattern-avoiding machines. They consist of two stacks in series, equipped with a greedy procedure. On both stacks we impose a static constraint in…

Combinatorics · Mathematics 2022-10-10 Giulio Cerbai

We analyse the set of matrices in SL$_3(\mathbb{F}_7)$ without eigenvalues explicitly, extracting nice bijections between the 18 equally sized conjugacy classes contained within. In doing so, we discover a set of $18$ commuting matrices for…

General Mathematics · Mathematics 2023-03-28 Juan Lucas Callo , George Chen , Yasiru Jayasooriya , Leo Li , Jingni Liao , William Liu , Michael Sun , Haibing Wang

Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata et al. found distributions of ascents and descents on permutations avoiding any…

Combinatorics · Mathematics 2024-11-06 Tian Han , Sergey Kitaev

For a fixed integer $m\ge 1$, let $\mathcal{A}_n^{(m)}$ be the set of permutations $\pi\in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1}-\pi_i|\le m$ for all $i$. Here, a pattern $132$ means three indices…

Combinatorics · Mathematics 2026-05-25 Teruki Mayama , Dai Akita

We prove that the rational elliptic curve y^2 = x^3 - n^2x satisfies the full Birch and Swinnerton-Dyer conjecture for at least 41.9% of positive squarefree integers n equal to 1, 2, or 3 mod 8, and that it satisfies the regular BSD…

Number Theory · Mathematics 2016-03-31 Alexander Smith

Valid hook configurations are combinatorial objects used to understand West's stack-sorting map. We extend existing bijections corresponding valid hook configurations to intervals in partial orders on Motzkin paths. To enumerate valid hook…

Combinatorics · Mathematics 2019-10-22 Maya Sankar

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…

Combinatorics · Mathematics 2007-05-23 David Callan

In this short paper we shall prove that there exist infinitely many consecutive square-free numbers of the form $[\alpha p]$, $[\alpha p]+1$, where $p$ is prime and $\alpha>0$ is irrational algebraic number. We also establish an asymptotic…

Number Theory · Mathematics 2019-07-09 S. I. Dimitrov

Given an STS(v), we ask if there is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. Results are obtained in the cases $\ell = 3,4$.

Combinatorics · Mathematics 2019-02-15 Donald L. Kreher , Douglas R. Stinson

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

Functional Analysis · Mathematics 2026-02-16 Mohsen Kian

In this paper we continue the investigation of coherent systems of type $(n,d,k)$ on the projective line which are stable with respect to some value of a parameter $\alpha$. We consider the case $k=1$ and study the variation of the moduli…

Algebraic Geometry · Mathematics 2007-10-08 H. Lange , P. E. Newstead

A sparsity pattern in $\mathbb{R}^{n \times m}$, for $m\geq n$, is a vector subspace of matrices admitting a basis consisting of canonical basis vectors in $\mathbb{R}^{n \times m}$. We represent a sparsity pattern by a matrix with…

Optimization and Control · Mathematics 2021-09-20 Mohamed Ali Belabbas , Xudong Chen , Daniel Zelazo

Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…

Combinatorics · Mathematics 2022-04-22 Elena Barcucci , Antonio Bernini , Renzo Pinzani
‹ Prev 1 3 4 5 6 7 10 Next ›