English
Related papers

Related papers: A short proof that adding some permutation rules t…

200 papers

We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…

Logic · Mathematics 2020-08-12 Anton Freund

In a preceding paper [E.J.ofProb.34,860-892,(2006)], we proved a sewing lemma which was a key result for the study of Holder continuous functions. In this paper we give a non-commutative version of this lemma with some applications.

Probability · Mathematics 2007-06-04 Denis Feyel , Arnaud De La Pradelle , Gabriel Mokobodzki

A permutation is simsun if for all k, the subword of the one-line notation consisting of the k smallest entries does not have three consecutive decreasing elements. Simsun permutations were introduced by Simion and Sundaram, who showed that…

Combinatorics · Mathematics 2009-12-09 Emeric Deutsch , Sergi Elizalde

An exactly solvable model for a description of the two-neutrino double beta decay transition of the Fermi type is considered. By using perturbation theory an explicit dependence of the two-neutrino double beta decay matrix element on the…

Nuclear Theory · Physics 2015-06-16 Dusan Stefanik , Fedor Simkovic , Kazuo Muto , Amand Faessler

We investigate some questions on the construction of $\eta$ operators for pseudo-Hermitian Hamiltonians. We give a sufficient condition which can be exploited to systematically generate a sequence of $\eta$ operators starting from a known…

Quantum Physics · Physics 2014-01-22 Soumendu Sundar Mukherjee , Pinaki Roy

We consider the following decision problem: given two simply typed $\lambda$-terms, are they $\beta$-convertible? Equivalently, do they have the same normal form? It is famously non-elementary, but the precise complexity - namely…

Logic in Computer Science · Computer Science 2024-09-11 Lê Thành Dũng Nguyên

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Combinatorics · Mathematics 2024-09-25 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

Finding necessary and sufficient conditions for isomorphism between two semigroups of order-preserving transformations over an infinite domain with restricted range was an open problem in \cite{FHQS}. In this paper, we show a proof strategy…

Rings and Algebras · Mathematics 2015-07-10 Phichet Jitjankarn , Thitarie Rungratgasame

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

Combinatorics · Mathematics 2017-05-15 Yan Zhuang

In this paper, we shall consider the notion of hyperbolic semi norm which on a module $X$ to set of all positive hyperbolic numbers. We shall prove the characterization of continuity of hyperbolic semi norm in this setup. We shall prove…

Functional Analysis · Mathematics 2024-02-13 Akshay S. Rane , Mandar Thatte

We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $\varphi$, the proportion of objects satisfying $\varphi$ converges to a limiting value as the size of the objects tends to…

Probability · Mathematics 2026-03-20 Alperen Özdemir

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Combinatorics · Mathematics 2026-05-29 Collier Gaiser , Paul Horn

We prove the validity of the $\varepsilon-\varepsilon^\beta$ property in the isoperimetric problem with double density, generalising the known properties for the case of single density. As a consequence, we derive regularity for…

Analysis of PDEs · Mathematics 2020-07-31 Aldo Pratelli , Giorgio Saracco

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then…

Number Theory · Mathematics 2022-01-19 Xiang-dong Hou , Vincenzo Pallozzi Lavorante

We show that every isoperimetric set in R^N with density is bounded if the density is continuous and bounded by above and below. This improves the previously known boundedness results, which basically needed a Lipschitz assumption; on the…

Functional Analysis · Mathematics 2012-09-18 Eleonora Cinti , Aldo Pratelli

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

We study the Case sum rules, especially $C_0$, for general Jacobi matrices. We establish situations where the sum rule is valid. Applications include an extension of Shohat's theorem to cases with an infinite point spectrum and a proof that…

Mathematical Physics · Physics 2009-11-07 Barry Simon , Andrej Zlatos

In this paper, firstly as a short note, we prove that a left derivation of a semiprime $\Gamma$-ring $M$ must map $M$ into its center, which improves a result by Paul and Halder and some results by Asci and Ceran. Also we prove that a…

Rings and Algebras · Mathematics 2012-06-20 Xiaowei Xu , Jing Ma , Yuan Zhou

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of a unimodal continuous map from the unit interval into itself, but it also characterizes univoque real…

Number Theory · Mathematics 2008-12-02 Jean-Paul Allouche

We show that for any two values $\alpha, \beta >0 $ for which $\alpha+\beta>1$ then there is a value $N$ so that for all $n \geq N$ the following holds. For any binary phylogenetic tree $T$ on $n$ leaves there is a set of $\lfloor n^\alpha…

Populations and Evolution · Quantitative Biology 2015-08-27 Mike Steel