English
Related papers

Related papers: Cascading Variants of Internal Approachability

200 papers

We develop flexible methods of deriving variational inference for models with complex latent variable structure. By splitting the variables in these models into "global" parameters and "local" latent variables, we define a class of…

Computation · Statistics 2019-04-23 Linda S. L. Tan , Aishwarya Bhaskaran , David J. Nott

Krueger showed that PFA implies that for all regular $\Theta \ge \aleph_2$, there are stationarily many $[H(\Theta)]^{\aleph_1}$ that are internally club but not internally approachable. From countably many Mahlo cardinals, we force a model…

Logic · Mathematics 2024-04-24 Hannes Jakob , Maxwell Levine

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

Logic · Mathematics 2019-12-19 Slavko Moconja , Predrag Tanović

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal

We obtain a relatively simple criterion for when a forcing has the ${<}\,\delta$-approximation property, generalizing a result of Unger. Afterwards we apply this criterion to construct variants of Mitchell Forcing in order to answer…

Logic · Mathematics 2025-08-15 Hannes Jakob

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First,…

Programming Languages · Computer Science 2019-08-19 Arshavir Ter-Gabrielyan , Alexander J. Summers , Peter Müller

We consider a variational model for two interacting species (or phases), subject to cross and self attractive forces. We show existence and several qualitative properties of minimizers. Depending on the strengths of the forces, different…

Analysis of PDEs · Mathematics 2015-07-31 Marco Cicalese , Lucia De Luca , Matteo Novaga , Marcello Ponsiglione

We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…

Formal Languages and Automata Theory · Computer Science 2015-07-20 Lorenzo Clemente , Sławomir Lasota

Identifying and explaining the structure of complex networks at different scales has become an important problem across disciplines. At the mesoscale, modular architecture has attracted most of the attention. At the macroscale, other…

Physics and Society · Physics 2018-11-09 María J. Palazzi , Javier Borge-Holthoefer , Claudio Tessone , Albert Solé-Ribalta

An adaptive proximal method for a special class of variational inequalities and related problems is proposed. For example, the so-called mixed variational inequalities and composite saddle problems are considered. Some estimates of the…

Optimization and Control · Mathematics 2020-08-25 Fedor S. Stonyakin

In this article we study invariance properties of shift-invariant spaces in higher dimensions. We state and prove several necessary and sufficient conditions for a shift-invariant space to be invariant under a given closed subgroup of…

Classical Analysis and ODEs · Mathematics 2010-02-08 Magalí Anastasio , Carlos Cabrelli , Victoria Paternostro

We investigate the one-dimensional Hubbard model with a confining potential, which may describe cold fermionic atoms trapped in an optical lattice. Combining the variational Monte Carlo simulations with the new stochastic reconfiguration…

Statistical Mechanics · Physics 2007-05-23 Yusuke Fujihara , Akihisa Koga , Norio Kawakami

In this paper we propose a theory of contact invariants and open string invariants, which are generalizations of the relative invariants. We introduce two moduli spaces $\bar{\mathcal{M}}_{A}(M^{+},C,g,m+\nu,{\bf y},{\bf…

Symplectic Geometry · Mathematics 2015-01-27 An-Min Li , Li Sheng

Characterisations of metrizable topological spaces or metrizable uniform spaces are well known. A natural counterpart to being metrizable for topological spaces can be expressed in terms of probabilistic metrizability for approach spaces.…

General Topology · Mathematics 2026-01-13 Eva Colebunders , Robert Lowen

Recently, a classical approach to continuous structures has been proposed in [ABBMZ] and [Z] that extends the class of structures falling under the scope of [HI] or [BBHU]. These articles introduce the notion of structures with a standard…

Logic · Mathematics 2025-10-27 Silvia Barbina , Riccardo Camerlo , Domenico Zambella

We associate a cohomological invariant to each outer action of a group on a factor, and classify them by the invariant in the case that the group is a countable discrete amenable group and the factor is appoximately finite dimensional. The…

Operator Algebras · Mathematics 2007-05-23 Yoshikazu Katayama , Masamichi Takesaki

We construct discrete holomorphic observables in the Ising model at criticality and show that they have conformally covariant scaling limits (as mesh of the lattice tends to zero). In the sequel those observables are used to construct…

Mathematical Physics · Physics 2009-09-30 Stanislav Smirnov

In this paper, we investigate the herdability property, namely the capability of a system to be driven towards the (interior of the) positive orthant, for linear time-invariant state-space models. Herdability of certain matrix pairs (A,B),…

Systems and Control · Electrical Eng. & Systems 2022-04-20 Giulia De Pasquale , Maria Elena Valcher

Stable matching is a fundamental area with many practical applications, such as centralised clearinghouses for school choice or job markets. Recent work has introduced the paradigm of near-feasibility in capacitated matching settings, where…

Computer Science and Game Theory · Computer Science 2026-02-12 Frederik Glitzner
‹ Prev 1 2 3 10 Next ›