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

We introduce the beta function of a knot in euclidean three-space. This is a meromorphic function of a complex variable which we prove admits a Bernstein type functional equation. We determine the first residues.

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

We prove that for any integers $\alpha, \beta > 1$, the existential fragment of the first-order theory of the structure $\langle \mathbb{Z}; 0,1,<, +, \alpha^{\mathbb{N}}, \beta^{\mathbb{N}}\rangle$ is decidable (where $\alpha^{\mathbb{N}}$…

Higher-order beta-matching is the following decision problem: given two simply typed lambda-terms, can the first term be instantiated to be beta-equivalent to the second term? This problem was formulated by Huet in the 1970s and shown…

The possibility to violate baryon or lepton number without introducing any new flavor structures, beyond those needed to account for the known fermion masses and mixings, is analyzed. With four generations, but only three colors, this…

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

We provide a direct proof of Agafonov's theorem which states that finite state selection preserves normality. We also extends this result to the more general setting of shifts of finite type by defining selections which are compatible the…

The proof of a recent result by Guido and Longo establishing the equivalence of the KMS-condition with complete $\beta$-boundedness is shortcut and generalized in such a way that a covariant version of the theorem is obtained.

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…

We give an elementary proof of a monotone selection principle which allows to pass from increasing nets to increasing sequences in the Hermitian part of a $\sigma$-finite von Neumann algebra. This is to be seen as a ``monotone version'' of…

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…

We prove that there exists a countable $\beta$-model in which, for all reals $X$ and $Y$, $X$ is definable from $Y$ if and only $X$ is hyperarithmetical in $Y$. We also obtain some related results and pose some related questions.

A {\it superpattern} is a string of characters of length $n$ that contains as a subsequence, and in a sense that depends on the context, all the smaller strings of length $k$ in a certain class. We prove structural and probabilistic results…

We propose a self-consistency equation for the $\beta$-function for theories with a large number of flavours, $N$, that exploits all the available information in the Wilson-Fisher critical exponent, $\omega$, truncated at a fixed order in…

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…

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…

The concept of pattern avoidance respectively containment in permutations can be extended to permutations on multisets in a straightforward way. In this note we present a direct proof of the already known fact that the well-known…

We consider an entangled but non-interacting qubit pair a_{1} and b_{1} that are independently coupled to a set of local qubit systems, a_{I} and b_{J}, of 0-bit value, respectively. We derive rules for the transfer of entanglement from the…

Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good behaviour under unit propagation. Several encodings with…

This work investigates preserving and reversing unimodality and convexity properties for sequences under transformations defined by sign-regular kernels. It is shown that these transformations only preserve these properties if the kernels…