English
Related papers

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

200 papers

In this paper we prove that, under certain conditions, a strong law of large number holds for a class of branching particle systems $X$ corresponding to the parameters $(Y,\beta,\psi)$, where $Y$ is a Hunt process and $\psi$ is the…

Probability · Mathematics 2014-10-21 Li Wang

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

Cryptography and Security · Computer Science 2019-07-12 Claude Gravel , Daniel Panario , David Thomson

A first-order theory T has the Schr\"oder-Bernstein (SB) property if any pair of elementarily bi-embeddable models are isomorphic. We prove that T has an expansion by constants that has the SB property if and only if T is superstable and…

Logic · Mathematics 2012-04-17 John Goodrick , Michael C. Laskowski

Let G be a primitive permutation group on a finite set Omega. Let p^2 divide |G|, for a prime p. We show that when G is solvable, there exists a subset of Omega whose stabilizer S has the property that 1<|S|_p<|G|_p. We offer a counting…

Group Theory · Mathematics 2026-03-24 David Gluck

We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…

Algebraic Topology · Mathematics 2013-03-21 Frederic Chazal , Vin de Silva , Marc Glisse , Steve Oudot

Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…

Logic in Computer Science · Computer Science 2024-08-06 Ioannis Eleftheriadis

In a compound decision problem, consisting of $n$ statistically independent copies of the same problem to be solved under the sum of the individual losses, any reasonable compound decision rule $\delta$ satisfies a natural symmetry…

Statistics Theory · Mathematics 2019-12-02 Asaf Weinstein

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

It has been known for many years that small fractions of persister cells resist killing in many bacterial colony-antimicrobial confrontations. These persisters are not believed to be mutants. Rather it has been hypothesized that they are…

Cell Behavior · Quantitative Biology 2007-05-23 I. Klapper , P. Gilbert , B. P. Ayati , J. Dockery , P. S. Stewart

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

Logic · Mathematics 2013-09-03 Heike Mildenberger , Saharon Shelah

We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…

Numerical Analysis · Mathematics 2021-02-15 Ulrik Skre Fjordholm , Markus Musch , Nils Henrik Risebro

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

Combinatorics · Mathematics 2007-05-23 M. H. Albert , M. D. Atkinson , Robert Brignall

We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for arbitrary beta-eta-retractions in simple and polymorphic types.

Logic in Computer Science · Computer Science 2007-05-23 Laurent Regnier , Pawel Urzyczyn

For each positive integer $n$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of the finite field $\mathbb F_q$ with $q$ elements, where $q$ is a prime power. It is known that for arbitrary $q$ and $n$, there exists an element…

Number Theory · Mathematics 2024-12-23 Arthur Fernandes , Daniel Panario , Lucas Reis

The (.)_reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)_reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget , Stuart W. Margolis

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

Number Theory · Mathematics 2021-08-03 Jorma Jormakka , Sourangshu Ghosh

This paper extends some results on the S-Lemma proposed by Yakubovich and uses the improved results to investigate the asymptotic stability of a class of switched nonlinear systems. Firstly, the strict S-Lemma is extended from quadratic…

Optimization and Control · Mathematics 2014-03-06 Kuize Zhang , Lijun Zhang , Fuchun Sun

In the framework of the Standard Model (SM) a theoretical description of the neutron beta decay is given at the level of 10^{-5}. The neutron lifetime and correlation coefficients of the neutron beta decay for a polarized neutron, a…

High Energy Physics - Phenomenology · Physics 2021-09-08 A. N. Ivanov , R. Höllwieser , N. I. Troitskaya , M. Wellenzohn , Ya. A. Berdnkov

We establish a necessary and sufficient condition for a representation of a lattice ordered semigroup to be regular, in the sense that certain extensions are completely positive definite. This result generalizes a theorem due to Brehmer…

Operator Algebras · Mathematics 2016-02-08 Boyu Li

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

Combinatorics · Mathematics 2018-03-02 John Engbers , Adam Hammett
‹ Prev 1 8 9 10 Next ›