English
Related papers

Related papers: Counting stabilized-interval-free permutations

200 papers

In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…

Algebraic Topology · Mathematics 2021-04-15 Oliver Gäfvert , Wojciech Chachólski

We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…

Combinatorics · Mathematics 2020-12-29 David Marchant

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

Combinatorics · Mathematics 2009-11-09 S. V. Avgustinovich , A. E. Frid , T. Kamae , P. V. Salimov

Integrate and fire oscillators are widely used to model the generation of action potentials in neurons. In this paper, we discuss small noise asymptotic results for a class of stochastic integrate and fire oscillators (SIFs) in which the…

Probability · Mathematics 2009-07-22 Peter Baxendale , John Mayberry

We study the problem of independence testing given independent and identically distributed pairs taking values in a $\sigma$-finite, separable measure space. Defining a natural measure of dependence $D(f)$ as the squared $L^2$-distance…

Statistics Theory · Mathematics 2020-11-09 Thomas B. Berrett , Ioannis Kontoyiannis , Richard J. Samworth

The technique of in-situ associative permuting is introduced which is an association of in-situ permuting and in-situ inverting. It is suitable for associatively permutable permutations of {1,2,...,n} where the elements that will be…

Data Structures and Algorithms · Computer Science 2013-01-11 A. Emre Cetin

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

Numerical Analysis · Mathematics 2022-05-04 Ben Adcock , Milana Gataric , José Luis Romero

We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain…

Numerical Analysis · Mathematics 2025-08-29 Zhenyu Zhao , Yanfei Wang , Xinran Liu

We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…

Functional Analysis · Mathematics 2007-10-25 Dorin E. Dutkay , Palle E. T. Jorgensen

A nonnegative integer is called a fertility number if it is equal to the number of preimages of a permutation under West's stack-sorting map. We prove structural results concerning permutations, allowing us to deduce information about the…

Combinatorics · Mathematics 2019-10-23 Colin Defant

Adaptive Local Iterative Filtering (ALIF) is a currently proposed novel time-frequency analysis tool. It has been empirically shown that ALIF is able to separate components and overcome the mode-mixing problem. However, so far its…

Numerical Analysis · Mathematics 2020-05-12 Antonio Cicone , Hau-Tieng Wu

Let g(x)=x/2 + 17/30 (mod 1), let \xi_i, i= 1,2,... be a sequence of independent, identically distributed random variables with uniform distribution on the interval [0,1/15], define g_i(x)=g(x)+ \xi_i (mod 1) and, for n=1,2,..., define…

Probability · Mathematics 2016-06-03 Thomas Kaijser

Given a real number beta>1, a permutation pi of length n is realized by the beta-shift if there is some x in [0,1] such that the relative order of the sequence x,f(x),...,f^{n-1}(x), where f(x) is the factional part of beta*x, is the same…

Combinatorics · Mathematics 2010-08-26 Sergi Elizalde

Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…

Combinatorics · Mathematics 2023-11-29 Adam Buck , Jennifer Elder , Azia A. Figueroa , Pamela E. Harris , Kimberly Harry , Anthony Simpson

We consider the modified Moran process on graphs to study the spread of genetic and cultural mutations on structured populations. An initial mutant arises either spontaneously (aka \emph{uniform initialization}), or during reproduction (aka…

Discrete Mathematics · Computer Science 2018-05-15 Andreas Pavlogiannis , Josef Tkadlec , Krishnendu Chatterjee , Martin A. Nowak

We consider stochastic difference equation x_{n+1} = x_n (1 - h f(x_n) + \sqrt{h} g(x_n) \xi_{n+1}), where functions f and g are nonlinear and bounded, random variables \xi_i are independent and h>0 is a nonrandom parameter. We establish…

Probability · Mathematics 2011-10-19 J. A. D. Appleby , G. Berkolaiko , A. Rodkina

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

Logic · Mathematics 2015-09-24 Pierre Simon

This is an expository paper about iterations of a smooth real function $f$ on $[0,\varepsilon)$ such that $f(0)=0$, $f'(0)=1$, and $f(x)<x$ for $x>0$, i.e., the sequence defined by $x_{n+1}=f(x_n)$. This sequence has interesting…

History and Overview · Mathematics 2025-06-23 Pavel Etingof

We deduce stability results for finite control set and mixed-integer model predictive control with a downstream oversampling phase. The presentation rests upon the inherent robustness of model predictive control with stabilizing terminal…

Systems and Control · Electrical Eng. & Systems 2026-05-07 Artemi Makarow , Christian Kirches

Suppose that Fourier transform of a function f is zero on the interval [-a,a]. We prove that the lower density of sign changes of f is at least a/pi, provided that f is a locally integrable temperate distribution in the sense of Beurling,…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Eremenko , D. Novikov