中文
相关论文

相关论文: Refined Restricted Involutions

200 篇论文

For positive integers $\alpha$ and $\beta$, we define an $(\alpha,\beta)$-walk to be any sequence of positive integers satisfying $w_{k+2}=\alpha w_{k+1}+\beta w_k$. We say that an $(\alpha,\beta)$-walk is $n$-slow if $w_s=n$ with $s$ as…

数论 · 数学 2019-09-17 Sam Spiro

The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources…

信息论 · 计算机科学 2023-05-11 Kel Levick , Ilan Shomorony

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For a positive integer $k$, define $S_{n,k}$ to be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles, i.e., \[ S_{n,k} = \{\pi \in S_{n}: \pi =…

组合数学 · 数学 2014-02-05 Cheng Yeaw Ku , Kok Bin Wong

Let $G=QD_{8k}~$ be the quasi-dihedral group of order $8n$ and $\theta$ be an automorphism of $QD_{8k}$ of finite order. The fixed-point set $H$ of $\theta$ is defined as $H_{\theta}=G^{\theta}=\{x\in G \mid \theta(x)=x\}$ and generalized…

群论 · 数学 2017-07-05 Zahid Raza , Imran , Bijan Davvaz

We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…

组合数学 · 数学 2023-05-31 Adam Kabela , Michal Polák , Jakub Teska

We deal with involution ordered semigroups possessing a greatest element, we introduce the concepts of $*$-regularity, $*$-intra-regularity, $*$-bi-ideal element and $*$-quasi-ideal element in this type of semigroups and, using the right…

综合数学 · 数学 2018-02-19 Niovi Kehayopulu

A (2,*)-group is a group that can be generated by two elements, one of which is an involution. We describe the method we have used to produce a census of all (2,*)-groups of order at most 6 000. Various well-known combinatorial structures…

群论 · 数学 2015-05-06 Primož Potočnik , Pablo Spiga , Gabriel Verret

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

组合数学 · 数学 2024-12-11 Michael Neubauer , Harmony Vargas

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

组合数学 · 数学 2024-07-11 Yuewen Luo

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0=a_0<a_1<\cdots<a_t$, the \emph{Stanley sequence} $S(A)=\{a_n\}$ is defined using the greedy algorithm: For each…

组合数学 · 数学 2014-08-21 David Rolnick , Praveen S. Venkataramana

Let $k\geq1$ be a fixed integer, and $\mathcal P_N$ be the set of primes no more than $N$. We prove that if a set $\mathcal A\subset\mathcal P_N$ contains no patterns $p_1,p_1+(p_2-1)^k$, where $p_1,p_2$ are prime numbers, then \[…

数论 · 数学 2024-10-15 Mengdi Wang

Feldman and Karlin conjectured that the number of isolated fixed points for deterministic models of viability selection and recombination among n possible haplotypes has an upper bound of 2^n - 1. Here a proof is provided. The upper bound…

种群与进化 · 定量生物学 2013-02-04 Lee Altenberg

We consider the class $S_n(1324)$ of permutations of size $n$ that avoid the pattern 1324 and examine the subset $S_n^{a\prec n}(1324)$ of elements for which $a\prec n\prec [a-1]$, $a\ge 1$. This notation means that, when written in one…

组合数学 · 数学 2024-11-06 Juan B. Gil , Oscar A. Lopez , Michael D. Weiner

An acyclic mapping from an $n$ element set into itself is a mapping $\phi$ such that if $\phi^k(x) = x$ for some $k$ and $x$, then $\phi(x) = x$. Equivalently, $\phi^\ell = \phi^{\ell+1} = ...$ for $\ell$ sufficiently large. We investigate…

概率论 · 数学 2007-05-23 Steven N. Evans , Tye Lidman

Observers in different inertial frames can see a set of spacelike separated events as occurring in different orders. Various restrictions are studied on the possible orderings of events that can be observed. In 1+1-dimensional spacetime {(1…

组合数学 · 数学 2011-04-05 Mark Heiligman

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…

组合数学 · 数学 2025-05-28 Atli Fannar Franklín

We describe absolute nilpotent and some idempotent elements of an $n$- dimensional evolution algebra corresponding to two permutations and we decompose such algebras to the direct sum of evolution algebras corresponding to cycles of the…

环与代数 · 数学 2020-05-11 B. A. Narkuziyev

Bernoulli convolutions are certain measures on the unit interval depending on a parameter $\beta$ between 1 and 2. In spite of their simple definition, they are not yet well understood. We study their two-dimensional density which exists by…

动力系统 · 数学 2017-11-29 Christoph Bandt

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…

组合数学 · 数学 2023-06-22 Hong Liu , Péter Pál Pach , Richárd Palincza

Phylogenetic trees play a key role in the reconstruction of evolutionary relationships. Typically, they are derived from aligned sequence data (like DNA, RNA, or proteins) by using optimization criteria like, e.g., maximum parsimony (MP).…

种群与进化 · 定量生物学 2025-06-11 Mirko Wilde , Mareike Fischer