English
Related papers

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

200 papers

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

Extensions (entropies) play a central role in the theory of hyperbolic conservation laws by providing intrinsic selection criteria for weak solutions. For a given hyperbolic system u_t+f(u)_x=0, a standard approach is to analyze directly…

Analysis of PDEs · Mathematics 2011-04-20 Helge Kristian Jenssen , Irina A. Kogan

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

Using a human-oriented formal example proof of the (lim+) theorem, i.e. that the sum of limits is the limit of the sum, which is of value for reference on its own, we exhibit a non-permutability of beta-steps and delta+-steps (according to…

Artificial Intelligence · Computer Science 2013-09-17 Claus-Peter Wirth

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

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

We propose a complete proof of the Born rule using an additional postulate stating that for a short enough time {\Delta}t between two measurements, a property of a particle will keep its values fixed. This dynamical postulate allows us to…

Quantum Physics · Physics 2023-08-22 Yakir Aharonov , Tomer Shushi

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ý

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman

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

Generalizing a result of Pourchet, we prove that, if $\alpha,\beta$ are power sums satisfying suitable conditions, the length of the continued fraction of the ratio $\alpha(n)/\beta(n)$ tends to infinity with $n$.

Number Theory · Mathematics 2007-05-23 Pietro Corvaja , Umberto Zannier

Consider the minimal $\beta$-shift containing the shift space generated by given Sturmian word. In this paper we characterize such $\beta$ and investigate its combinatorial, dynamical and topological properties and prove that such $\beta$…

Combinatorics · Mathematics 2007-05-23 Dong Pyo Chi , DoYong Kwon

Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…

Logic in Computer Science · Computer Science 2024-11-05 Hichem Rami Ait El Hara , François Bobot , Guillaume Bury

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

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

The purpose of the present paper is to analyze several variants of Solovay's theorem on the existence of doubly partially conservative sentences. First, we investigate $\Theta$ sentences that are doubly $(\Gamma, \Lambda)$-conservative over…

Logic · Mathematics 2025-03-18 Haruka Kogure , Taishi Kurahashi

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

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

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

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