Related papers: A Non-commutative Monotone Selection Principle

We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…

Given a Dedekind incomplete ordered field, a pair of convergent nets of gaps which are respectively increasing or decreasing to the same point is used to obtain a further equivalent criterion for Dedekind completeness of ordered fields:…

We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…

In a pre-selected Hilbert space of quantum states the unitarity of the evolution is usually guaranteed via a pre-selection of the generator (i.e., of the Hamiltonian operator) in self-adjoint form. In fact, the simultaneous use of both of…

For a set-valued stochastic sequence $(G_n)_{n=0}^N$ with relatively open convex values $G_n(\omega)$ we give a criterion for the existence of an adapted sequence $(x_n)_{n=0}^N$ of selectors, admitting an equivalent martingale measure.…

We report an approach to obtaining complex networks with diverse topology, here called syntonets, taking into account the consonances and dissonances between notes as defined by scale temperaments. Though the fundamental frequency is…

We prove that norm continuous derivations from a von Neumann algebra into the algebra of operators affiliated with its tensor square are automatically continuous for both the strong operator topology and the measure topology. Furthermore,…

Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…

We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…

We develop techniques to deal with monotonicity of sequences z_{n+1}/z_n and \sqrt[n]{z_n}. A series of conjectures of Zhi-Wei Sun and of Amdeberhan et al. are verified in certain unified approaches.

We construct new algorithms from scratch, which use the fourth order cumulant of stochastic variables for the cost function. The multiplicative updating rule here constructed is natural from the homogeneous nature of the Lie group and has…

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

An "entropy increasing to the maximum" result analogous to the entropic central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the discrete setting. This involves the thinning operation and a Poisson limit. Monotonic…

Based on an idea of Y. P\'eresse and some results of Maltcev, Mitchell and Ru\v{s}kuc, we present sufficient conditions under which the endomorphism monoid of a countably infinite ultrahomogeneous first-order structure has the Bergman…

We establish, for a generically big Hermitian line bundle, the convergence of truncated Harder-Narasimhan polygons and the uniform continuity of the limit. As applications, we prove a conjecture of Moriwaki asserting that the arithmetic…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.