Related papers: Square principles in Pmax extensions

We use convex integration techniques to provide examples of failure of weighted Calder\'{o}n-Zygmund estimates for degenerate linear elliptic PDEs when the weights are in $A_p$, $p > 2$.

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

We isolate two combinatorial properties, each expressible by a $\Pi_2$-sentence over the structure $(H(\omega_3),\in,\omega_1,\omega_2,\text{NS}_{\omega_2})$, such that each property is consistent with CH, and their conjunction together…

We demonstrate that any $\Pi_\alpha$ sentence of the infinitary logic $L_{\omega_1 \omega}$ extending the theory of linear orderings has a model with a $\Pi_{\alpha+4}$ Scott sentence and hence of Scott rank at most $\alpha+3$. In other…

Let y1, y2, y3, a1, a2, a3 > 0 be such that y1 y2 y3 = a1 a2 a3 and y1 + y2 + y3 >= a1 + a2 + a3, y1 y2 + y2 y3 + y1 y3 >= a1 a2 + a2 a3 + a1 a3. Then the following inequality holds (log y1)^2 + (log y2)^2 + (log y3)^2 >= (log a1)^2 + (log…

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

One way of improving the behavior of finite element schemes for classical, time-dependent Maxwell's equations, is to render them from their hyperbolic character to elliptic form. This paper is devoted to the study of the stabilized linear…

We introduce and study some general principles and hierarchical properties of expansions and restrictions of structures and their theories The general approach is applied to describe these properties for classes of $\omega$-categorical…

We dominate non-integral singular operators by adapted sparse operators and derive optimal norm estimates in weighted spaces. Our assumptions on the operators are minimal and our result applies to an array of situations, whose prototype are…

We develop a new method for building forcing iterations with symmetric systems of structures as side conditions. Using our method we prove that the forcing axiom for the class of all the small finitely proper posets is compatible with a…

We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximating a problem beyond a certain threshold requires…

We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic…

In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to…

For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…

The Schwarz--Pick lemma is a fundamental result in complex analysis. It is well-known that Yau generalized it to the higher dimensional manifolds by applying his maximum principle for complete Riemannian manifolds. Jeffres obtained Schwarz…

Piecewise Linear-Quadratic (PLQ) penalties are widely used to develop models in statistical inference, signal processing, and machine learning. Common examples of PLQ penalties include least squares, Huber, Vapnik, 1-norm, and their…