English
Related papers

Related papers: Forbidden ordinal patterns in higher dimensional d…

200 papers

In this paper we relate t-designs to a forbidden configuration problem in extremal set theory. Let 1_t 0_l denote a column of t 1's on top of l 0's. We assume t>l. Let q. (1_t 0_l) denote the (t+l)xq matrix consisting of t rows of q 1's and…

Combinatorics · Mathematics 2019-09-26 R. P. Anstee , Farzin Barekat , Zachary Pellegrin

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

Combinatorics · Mathematics 2014-12-24 Mamadou Moustapha Kanté , O-joung Kwon

We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…

Dynamical Systems · Mathematics 2020-11-24 Douglas Coates , Mark Holland , Dalia Terhesiu

We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…

Combinatorics · Mathematics 2007-05-23 John Noonan , Doron Zeilberger

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

Combinatorics · Mathematics 2007-05-23 M. H. Albert , M. D. Atkinson , Robert Brignall

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…

Machine Learning · Computer Science 2021-05-26 Aïssatou Diallo , Johannes Fürnkranz

In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given…

Chaotic Dynamics · Physics 2015-03-10 Valentina A. Unakafova , Anton M. Unakafov , Karsten Keller

In this paper, we study temporal graphs arising from mobility models, where vertices correspond to agents moving in space and edges appear each time two agents meet. We propose a rather natural one-dimensional model. If each pair of agents…

Data Structures and Algorithms · Computer Science 2024-09-20 Mónika Csikós , Michel Habib , Minh-Hang Nguyen , Mikaël Rabie , Laurent Viennot

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

Discrete Mathematics · Computer Science 2021-04-22 Vuong Bui

The pattern avoidance problem seeks to construct a set $X\subset \mathbb{R}^d$ with large dimension that avoids a prescribed pattern. Examples of such patterns include three-term arithmetic progressions (solutions to $x_1 - 2x_2 + x_3 =…

Classical Analysis and ODEs · Mathematics 2019-04-05 Jacob Denson , Malabika Pramanik , Joshua Zahl

We consider scalar-input control systems in the vicinity of an equilibrium, at which the linearized systems are not controllable. For finite dimensional control systems, the authors recently classified the possible quadratic behaviors.…

Optimization and Control · Mathematics 2019-05-27 Karine Beauchard , Frédéric Marbach

This paper introduces the notion of mesh patterns in multidimensional permutations and initiates a systematic study of singleton mesh patterns (SMPs), which are multidimensional mesh patterns of length 1. A pattern is avoidable if there…

Combinatorics · Mathematics 2024-03-06 Sergey Avgustinovich , Sergey Kitaev , Jeffrey Liese , Vladimir Potapov , Anna Taranenko

We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…

Combinatorics · Mathematics 2015-09-10 Christian Huck , Christoph Richard

Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes possible to describe such properties by a finite set of…

Combinatorics · Mathematics 2021-12-02 Santiago Guzmán-Pro , Pavol Hell , César Hernández-Cruz

We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative importance in a given time series. To this end we extend i) the use of ordinal patterns-based probability distribution…

Tight bounds on the block entropy of patterns of sequences generated by independent and identically distributed (i.i.d.) sources are derived. A pattern of a sequence is a sequence of integer indices with each index representing the order of…

Information Theory · Computer Science 2007-11-14 Gil I. Shamir

We study whether visual embedding models capture continuous, ordinal attributes along linear directions, which we term _rank axes_. We define a model as _rankable_ for an attribute if projecting embeddings onto such an axis preserves the…

Computer Vision and Pattern Recognition · Computer Science 2025-07-08 Ankit Sonthalia , Arnas Uselis , Seong Joon Oh

In the field of dynamical systems, it is not rare to meet irregular functions, which are typically H{\"o}lder but not Lipschitz (e.g. the Weierstrass functions). Our goal is to scratch the surface of the following question: what happens if…

Dynamical Systems · Mathematics 2022-10-25 Benoît Kloeckner , Nicolae Mihalache

We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\op_{n,k}(p)$ be the number of ordered set partitions of $\{1,2,\ldots,n\}$ into $k$ blocks that…

Combinatorics · Mathematics 2013-07-02 Anisse Kasraoui

Recently, it was realized that anomalies can be completely classified by topological orders, symmetry protected topological (SPT) orders, and symmetry enriched topological orders in one higher dimension. The anomalies that people used to…

Strongly Correlated Electrons · Physics 2019-11-06 Wenjie Ji , Xiao-Gang Wen