English
Related papers

Related papers: Higher-dimensional forcing

200 papers

We describe a new method for constructing a weight structure $w$ on a triangulated category $C$. For a given $C$ and $w$ it allow us to give a fairly comprehensive (and new) description of those triangulated categories consisting of…

K-Theory and Homology · Mathematics 2017-01-24 Mikhail V. Bondarko , Vladimir A. Sosnilo

We provide the first known upper bounds for the packing dimension of weighted singular and weighted $\omega$-singular matrices. We also prove upper bounds for these sets when intersected with fractal subsets. The latter results, even in the…

Number Theory · Mathematics 2026-05-05 Gaurav Aggarwal , Anish Ghosh

First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic. In this paper, we argue that the capabilities of FOMC algorithms to date are limited by their…

Logic in Computer Science · Computer Science 2023-06-08 Paulius Dilkas , Vaishak Belle

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

In this paper we study the optimal reinforcement of an elastic membrane, fixed at its boundary, by means of a network (connected onedimensional structure), that has to be found in a suitable admissible class. We show the existence of an…

Analysis of PDEs · Mathematics 2019-05-22 Giovanni Alberti , Giuseppe Buttazzo , Serena Guarino Lo Bianco , Edouard Oudet

Many physical systems are well described on domains which are relatively large in some directions but relatively thin in other directions. In this scenario we typically expect the system to have emergent structures that vary slowly over the…

Dynamical Systems · Mathematics 2016-12-15 A. J. Roberts , J. E. Bunder

Although inverse limits with factor spaces indexed by the positive integers are most commonly studied, Ingram and Mahavier have defined inverse limits with set-valued functions broadly enough for any directed index set to be used. In this…

General Topology · Mathematics 2015-11-03 Scott Varagona

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

Optimization and Control · Mathematics 2021-10-20 Marius Costandin

In the framework of Model Predictive Control (MPC), the control input is typically computed by solving optimization problems repeatedly online. For general nonlinear systems, the online optimization problems are non-convex and…

Optimization and Control · Mathematics 2021-03-31 Zheming Wang , Raphaël M. Jungers

We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number…

Statistics Theory · Mathematics 2019-05-01 Jordan S. Ellenberg , Lalit Jain

Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a…

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

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

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

Logic · Mathematics 2023-11-09 Nikolay Bazhenov , Hristo Ganchev , Stefan Vatev

We study the strong structural controllability (SSC) of diffusively coupled networks, where the external control inputs are injected to only some nodes, namely the leaders. For such systems, one measure of controllability is the dimension…

Systems and Control · Electrical Eng. & Systems 2020-08-18 Yasin Yazicioglu , Mudassir Shabbir , Waseem Abbas , Xenofon Koutsoukos

We present a new unified theory of critical finite-size scaling for lattice statistical mechanical models with periodic boundary conditions above the upper critical dimension. Our theory is based on recent mathematically rigorous results…

Statistical Mechanics · Physics 2026-03-02 Yucheng Liu , Jiwoon Park , Gordon Slade

We introduce some notions of conditional mean dimension for a factor map between two topological dynamical systems and discuss their properties. With the help of these notions, we obtain an inequality to estimate the mean dimension of an…

Dynamical Systems · Mathematics 2021-11-16 Bingbing Liang

The micromechanics of a variety of systems experiencing a structural arrest due to their high density could be unified by a thermodynamic framework governing their approach to 'jammed' configurations. The mechanism of supporting an applied…

Soft Condensed Matter · Physics 2007-05-23 Jasna Brujic , Sam F. Edwards , Ian Hopkinson , Hernan A. Makse

We define the finest order on inductive limits of ordered cones which makes the linear mappings monotone and gives rise to the definition of inductive limit topologies for cones. Using the polars of neighborhoods, we establish embeddings…

Functional Analysis · Mathematics 2020-12-02 M. R. Motallebi

We call a function $f$ in $C(X)$ to be hard-bounded if $f$ is bounded on every hard subset, a special kind of closed subset, of $X$. We call a subset $T$ of $X$ to be $S$-embedded if every hard-bounded continuous function of $T$ can be…

General Topology · Mathematics 2022-04-22 Biswajit Mitra , Sanjib Das