English
Related papers

Related papers: Forcing, genericity and CBERS

200 papers

We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…

Logic · Mathematics 2026-03-12 Radek Honzik

Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well-known approach to this, and one for which constraint programming has been shown to be a well-suited and generic framework. Dominance…

Artificial Intelligence · Computer Science 2019-10-02 Gökberk Koçak , Özgür Akgün , Tias Guns , Ian Miguel

Analyses based on quantum metrology have shown that the ability to localize the positions of two incoherent point sources can be significantly enhanced through the use of mode sorting. Here we theoretically and experimentally investigate…

This is a mostly expository paper, intended to explain a very natural relationship between two a priori distinct notions appearing in the literature: Generic Vanishing in the context of vanishing theorems and birational geometry, and…

Algebraic Geometry · Mathematics 2009-11-23 Mihnea Popa

For sufficiently smooth bounded plane domains, the equivalence between the inequalities of Babu{\v s}ka --Aziz for right inverses of the divergence and of Friedrichs on conjugate harmonic functions was shown by Horgan and Payne in 1983 [7].…

Analysis of PDEs · Mathematics 2015-07-31 Martin Costabel

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

Logic · Mathematics 2018-05-23 Natasha Dobrinen

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

Programming Languages · Computer Science 2011-01-25 Vilhelm Sjöberg , Aaron Stump

Let $X$ be a scheme, proper over a commutative noetherian ring $A$. We introduce the concept of an ample filter of invertible sheaves on $X$ and generalize the most important equivalent criteria for ampleness of an invertible sheaf. We also…

Algebraic Geometry · Mathematics 2018-06-05 Dennis S. Keeler

This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…

K-Theory and Homology · Mathematics 2009-04-30 Mohamed Barakat

Let K be a a Lie group, modeled on a locally convex space, and M a finite-dimensional paracompact manifold with corners. We show that each continuous principal K-bundle over M is continuously equivalent to a smooth one and that two smooth…

Differential Geometry · Mathematics 2012-06-29 Christoph Müller , Christoph Wockel

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

Logic · Mathematics 2016-09-06 Haim Judah , Andrzej Rosłanowski , Saharon Shelah

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

Logic · Mathematics 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

Metric Geometry · Mathematics 2015-03-17 Justin Malestein , Louis Theran

In his Ph.D. thesis, Farber proved that every strongly chordal graph can be represented as intersection graph of subtrees of a weighted tree, and these subtrees are ``compatible''. Moreover, this is an equivalent characterization of…

Combinatorics · Mathematics 2025-03-13 Therese Biedl

Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…

Logic in Computer Science · Computer Science 2016-11-22 Henning Christiansen , Maja H. Kirkeby

It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…

Complex Variables · Mathematics 2007-05-23 M. S. Baouendi , P. Ebenfelt , L. P. Rothschild

In this review article, we discuss connections between the physics of disordered systems, phase transitions in inference problems, and computational hardness. We introduce two models representing the behavior of glassy systems, the spiked…

Disordered Systems and Neural Networks · Physics 2022-12-07 David Gamarnik , Cristopher Moore , Lenka Zdeborová

We prove that various notions of supersolutions to the porous medium equation are equivalent under suitable conditions. More spesifically, we consider weak supersolutions, very weak supersolutions, and $m$-superporous functions defined via…

Analysis of PDEs · Mathematics 2016-03-14 Pekka Lehtelä , Teemu Lukkari

We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…

Combinatorics · Mathematics 2011-11-14 Matthew Macauley , Henning S. Mortveit

We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H_2) are called forcing. Non-bipartite forcing pairs were…

Combinatorics · Mathematics 2019-06-11 Tamas Hubai , Dan Kral , Olaf Parczyk , Yury Person