JP063 Chapter 06　Inflation

Proof of Theorem 2: The Push-and-Pull algorithm consists of the Initialization phase to generate an initial tableau that contains some basic variables, followed by the Push and

Proof of Theorem 2: The Push-and-Pull algorithm consists of the Initialization phase to generate an initial tableau that contains some basic variables, followed by the Push and

This paper is devoted to the study of maximum principles holding for some nonlocal diffusion operators defined in (half-) bounded domains and its applications to obtain

The study of the eigenvalue problem when the nonlinear term is placed in the equation, that is when one considers a quasilinear problem of the form −∆ p u = λ|u| p−2 u with

We will give a different proof of a slightly weaker result, and then prove Theorem 7.3 below, which sharpens both results considerably; in both cases f denotes the canonical

We give another global upper bound for Jensen’s discrete inequal- ity which is better than already existing ones.. For instance, we determine a new converses for generalized A–G and

In particular this implies a shorter and much more transparent proof of the combinatorial part of the Mullineux conjecture with additional insights (Section 4). We also note that

Given a marked Catalan tree (T, v), we will let [T, v] denote the equivalence class of all trees isomorphic to (T, v) as a rooted tree, where the isomorphism sends marked vertex