Related papers: Strongly proper forcing and some problems of Forem…
Freiman's theorem gives a lower bound for the cardinality of the doubling of a finite set in $\RR^n$. In this paper we give an interpretation of his theorem for monomial ideals and their fiber cones. We call a quasi-equigenerated monomial…
We resolve a long-standing open problem posed by Federer concerning the rectifiability of the integral geometric measure with exponent p >1, thereby settling a question that has persisted since its formulation. While the main theorem is…
This article is concerned with the well-posedness of the "filtering equations", due to Zakai and Kushner-Stratonovich, arising in nonlinear stochastic filtering. In general situations, notably in correlated diffusion models and when signal…
In this paper, we investigate the two-dimensional incompressible primitive equations with fractional horizontal dissipation. Specifically, we establish global well-posedness of strong solutions for arbitrarily large initial data when the…
We present a modified Front Tracking (mFT) scheme for hyperbolic systems of conservation laws in one space dimension, in which we allow arbitrarily large nonlinear waves. We build the scheme by introducing and solving a ``generalized…
In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F. Our key idea was to introduce an extended…
In this paper, we study in prime fields the exceptional set estimates, which can be viewed as a refinement of Marstrand's orthogonal projection theorem. Additionally, we address a Furstenberg-type problem, which is closely related. It is…
This paper continues the investigation of quasilength, of content of local cohomology with respect to generators of the support ideal, and of robust algebras begun in joint work of Hochster and Huneke. We settle several questions raised by…
Machine learning models suffer from overfitting, which is caused by a lack of labeled data. To tackle this problem, we proposed a framework of regularization methods, called density-fixing, that can be used commonly for supervised and…
Solving the many-electron problem, even approximately, is one of the most challenging and simultaneously most important problems in contemporary condensed matter physics with various connections to other fields. The standard approach is to…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…
Let $\mathbb{Q}$ denote the poset which adds a Cohen real then shoots a club through the complement of $\big( [\omega_2]^\omega \big)^V$ with countable conditions. We prove that the version of Strong Chang's Conjecture from \cite{MR2965421}…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
A choice of first-order variables for the characteristic problem of the linearized Einstein equations is found which casts the system into manifestly well-posed form. The concept of well-posedness for characteristic problems invoked is that…
In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…
We introduce an effective field theory (EFT) for conformal impurity by considering a pair of transversely displaced impurities and integrating out modes with mass inversely proportional to the separation distance. This EFT captures the…
We consider strongly convex optimization problems with affine-type restrictions. We build dual problem and solve dual problem by Fast Gradient Method. We use primal-dual structure of this method to construct the solution of the primal…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…