English
Related papers

Related papers: Permutation patterns: basic definitions and notati…

200 papers

This is a brief introduction to the basic concepts of topology. It includes the basic constructions, discusses separation properties, metric and pseudometric spaces, and gives some applications arising from the use of topology in computing.

Logic · Mathematics 2015-03-04 E. -E. Doberkat

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

Commutative Algebra · Mathematics 2022-05-19 Gérard Leloup

We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lead to some interesting properties. For a permutation sampled…

Combinatorics · Mathematics 2017-11-30 Chaim Even-Zohar

The study of associations and their causal explanations is a central research activity whose methodology varies tremendously across fields. Even within specialized subfields, comparisons across textbooks and journals reveals that the basics…

Methodology · Statistics 2025-10-13 Sander Greenland

Lecture-notes: introducing and discussing basic kp concepts related to bands interaction at an elementary level to beginners

Mesoscale and Nanoscale Physics · Physics 2021-06-28 Josep Planelles

We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…

General Mathematics · Mathematics 2007-05-23 Rakotonirina Christian

Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…

Combinatorics · Mathematics 2019-01-03 Sergi Elizalde , Katherine Moore

A permutomino of size n is a polyomino determined by particular pairs (P1, P2) of permutations of size n, such that P1(i) is different from P2(i), for all i. Here we determine the combinatorial properties and, in particular, the…

Combinatorics · Mathematics 2007-11-06 A. Bernini , F. Disanto , R. Pinzani , S. Rinaldi

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

Probability · Mathematics 2020-11-10 Jacopo Borga , Erik Slivken

Fracture functions and their evolution equations are reviewed. Some phenomenological applications are briefly discussed.

High Energy Physics - Phenomenology · Physics 2007-05-23 M. Grazzini

We describe several families of permutation polynomials obtained using functions with linear translators.

Number Theory · Mathematics 2009-05-08 Gohar M. Kyureghyan

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Combinatorics · Mathematics 2007-05-23 Sergey Avgustinovich , Sergey Kitaev

We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations…

Combinatorics · Mathematics 2012-03-13 Anders Claesson , Henning Úlfarsson

Both a general and a diagonal u-invariant for forms of higher degree are defined, generalizing the u-invariant of quadratic forms. Both old and new results on these invariants are collected.

Number Theory · Mathematics 2007-05-23 S. Pumpluen

In this chapter we provide an overview of computational modeling for semantic change using large and semi-large textual corpora. We aim to provide a key for the interpretation of relevant methods and evaluation techniques, and also provide…

Computation and Language · Computer Science 2023-04-14 Nina Tahmasebi , Haim Dubossarsky

We discuss the notion of the orbifold transform, and illustrate it on simple examples. The basic properties of the transform are presented, including transitivity and the exponential formula for symmetric products. The connection with the…

Group Theory · Mathematics 2009-11-13 P. Bantay

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Sophie Huczynska , Vincent Vatter

Several different types of statistical interaction are defined and distinguished, primarily on the basis of the nature of the factors defining the interaction. Illustrative examples, mostly epidemiological, are given. The emphasis is…

Applications · Statistics 2009-09-29 Amy Berrington de González , D. R. Cox

BPMN represents an industrial standard created to offer a common and user friendly notation to all the participants to a business process. The present paper aims to briefly present the main features of this notation as well as an…

Software Engineering · Computer Science 2009-04-24 Alexandra Fortis

Interoperability is crucial for modern scientific advancement, yet its fragmented definitions across domains hinder researchers' ability to effectively reap the rewards. This paper proposes a new, universal definition by tracing the…

Computers and Society · Computer Science 2024-08-30 Giada Lalli