English
Related papers

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

200 papers

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

Combinatorics · Mathematics 2015-12-01 Luis Manuel Rivera

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

Combinatorics · Mathematics 2017-09-06 Rutilo Moreno , Luis Manuel Rivera

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

Group Theory · Mathematics 2018-02-27 Attila Nagy

We consider a number of generalizations of the $\beta$-extended MacMahon Master Theorem for a matrix. The generalizations are based on replacing permutations on multisets formed from matrix indices by partial permutations or derangements…

Combinatorics · Mathematics 2014-01-22 Michael P. Tuite

Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…

Logic · Mathematics 2016-12-19 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

In the framework of explicit substitutions there is two termination properties: preservation of strong normalization (PSN), and strong normalization (SN). Since there are not easily proved, only one of them is usually established (and…

Logic in Computer Science · Computer Science 2009-10-08 Emmanuel Polonowski

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

For a partition {\lambda} and a prime p, we prove a necessary and sufficient condition for there exists a composition {\delta} such that {\delta} can be obtained from {\lambda} after rearrangement and all the partial sums of {\delta} are…

Representation Theory · Mathematics 2020-03-17 Kay Jin Lim , Jialin Wang

In the framework of the generalized uncertainty principle, the position and momentum operators obey the modified commutation relation $[X,P]=i\hbar\left(1+\beta P^2\right)$ where $\beta$ is the deformation parameter. Since the validity of…

Quantum Physics · Physics 2016-05-03 Pouria Pedram

A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…

Data Structures and Algorithms · Computer Science 2015-01-13 Ivan Bliznets , Marek Cygan , Pawel Komosa , Lukas Mach

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

We consider continued fractions with partial quotients in the ring of integers of a quadratic number field $K$ and we prove a generalization to such continued fractions of the classical theorem of Lagrange. A particular example of these…

Number Theory · Mathematics 2020-05-14 Zuzana Masáková , Tomáš Vávra , Francesco Veneziano

This paper investigates the $\beta$-symmetry of the heterotic string theory at order $\alpha'$ in the context of open spacetime manifolds. Our analysis reveals that the parity-odd component of the effective action at this order remains…

High Energy Physics - Theory · Physics 2023-08-29 Mohammad R. Garousi

We study the \cal{N}=1 SU(N) SYM theory which is a marginal deformation of the \cal{N}=4 theory, with a complex deformation parameter \beta. We consider the large N limit and study perturbatively the conformal invariance condition. We find…

High Energy Physics - Theory · Physics 2010-02-03 Federico Elmetti , Andrea Mauri , Silvia Penati , Alberto Santambrogio , Daniela Zanon

We consider a one dimensional affine switched system obtained from a formal limit of a two dimensional linear system. We show this is equivalent to minimising the average digit in beta representations with unrestricted digits. We give a…

Optimization and Control · Mathematics 2025-09-11 Carl P. Dettmann

We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…

Dynamical Systems · Mathematics 2012-03-27 Tom Kempton

Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…

Logic · Mathematics 2018-04-03 David M. Cerna , Anela Lolic

Series expansions for the mathematical constant $\beta(4)$ are rare in the history. With the help of the operator method and a hypergeometric transformation, we prove a surprising conjectural series of Sun for $\beta(4)$. Furthermore, we…

Number Theory · Mathematics 2023-03-10 Chuanan Wei

We demonstrate that commutativity of numerous one-dimensional subalgebras in $W_{1+\infty}$ algebra, i.e. the existence of many non-trivial integrable systems described in recent arXiv:2303.05273 follows from the subset of relations in…

High Energy Physics - Theory · Physics 2023-08-30 A. Mironov , V. Mishnyakov , A. Morozov , A. Popolitov

In this paper we show that the following problem is NP-complete: Given an alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there exists a permutation of $\Sigma$ which is a subsequence of both of the given strings.

Computational Complexity · Computer Science 2008-04-01 Marián Dvorský