English
Related papers

Related papers: On $k$-modal subsequences

200 papers

For any $n$ and $k$, we provide an explicit (that is, computable in polynomial time) example of integer $B_k$-sequence of size $n$ consisting of elements bounded by $n^{k+o(k)}$.

Combinatorics · Mathematics 2023-04-11 Igor S. Sergeev

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

A strictly increasing sequence (n_k) of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that the supremum over k of the norms ||T^{n_k}|| is finite, the set of…

Functional Analysis · Mathematics 2011-06-14 Tanja Eisner , Sophie Grivaux

Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…

Combinatorics · Mathematics 2025-09-05 François Clément

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.

Combinatorics · Mathematics 2021-04-07 Qingyi Huo

A $k$-uniform tight cycle is a $k$-uniform hypergraph with a cyclic ordering of its vertices such that its edges are all the sets of size $k$ formed by $k$ consecutive vertices in the ordering. We prove that every red-blue edge-coloured…

Combinatorics · Mathematics 2022-12-08 Allan Lo , Vincent Pfenninger

In this paper, we prove the converse of the dynamical Mordell--Lang conjecture in positive characteristic: For every subset $S \subseteq \mathbb{N}_0$ which is a union of finitely many arithmetic progressions along with finitely many…

Number Theory · Mathematics 2025-01-15 Jungin Lee , Gyeonghyeon Nam

For $D$ a natural number that is not a perfect square and for $k$ a non-zero integer, consider the subset $\mathbb{Z}_k(\sqrt{D})$ of the quadratic integer ring $\mathbb{Z}(\sqrt{D})$ consisting of elements $x+y\sqrt{D}$ for which $x^2 -…

Number Theory · Mathematics 2024-02-19 Christine Patterson , Marion Scheepers

Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…

Combinatorics · Mathematics 2007-05-23 Miklos Bona , Bruce Sagan , Vincent Vatter

We have found maximum possible runs of consecutive positive integers each having exactly $k$ divisors for some fixed values of $k$. In addition, we exhibit the run of 10 consecutive positive integers each having exactly 12 divisors and two…

Number Theory · Mathematics 2015-10-27 Vladimir A. Letsko

We establish that a mode-coupling approximation for the dynamics of multi-component systems obeying Smoluchowski dynamics preserves a subtle yet fundamental property: the matrices of partial density correlation functions are completely…

Soft Condensed Matter · Physics 2011-08-12 T. Franosch , Th. Voigtmann

We prove a conjecture of Drew Armstrong on the average maximal length of $k$-alternating subsequence of permutations. The $k=1$ case is a well-known result of Richard Stanley.

Combinatorics · Mathematics 2015-02-06 Tommy Wuxing Cai

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…

Statistics Theory · Mathematics 2007-06-13 Fadoua Balabdaoui , Jon A. Wellner

Let $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct…

Number Theory · Mathematics 2009-03-02 Weidong Gao , Y. O. Hamidoune , Guoqing Wang

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…

Symbolic Computation · Computer Science 2024-07-29 Hans Zantema

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

Combinatorics · Mathematics 2014-10-03 Jie Ma

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

Combinatorics · Mathematics 2026-05-01 Dmitrii Taletskii

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

Given a construction of smooth homotopy class invariants of smooth immersions $M^n\to R^{n+k}$. The particular case of $k=1, n\ge 1$ is a sequence of non-zero integrals, where the $n=2$ term is the Gauss-Bonnet integral

Differential Geometry · Mathematics 2007-05-23 Valery Dolotin

We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.

Number Theory · Mathematics 2019-07-16 Ioulia N. Baoulina
‹ Prev 1 3 4 5 6 7 10 Next ›