Related papers: Higher-dimensional forcing
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
We give upper-bounds for the dimension of some linear systems. The theorem improves the differential Horace method introduced by Alexander-Hirschowitz, and was conjectured by Simpson. Possible applications are the calculus of the dimension…
A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…
The packing of elastic bodies has emerged as a paradigm for the study of macroscopic disordered systems. However, progress is hampered by the lack of controlled experiments. Here we consider a model experiment for the isotropic…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
We show that it is possible to build up a consistent model describing a superconducting cosmic string (SCS) endowed with torsion. A full string solution is obtained by matching the internal and the external solutions. We derive the deficit…
We consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an…
We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…
The problem of determining those multiplets of forces, or sets of force multiplets, acting at a set of points, such that there exists a truss structure, or wire web, that can support these force multiplets with all the elements of the truss…
Using a finite support iteration of ccc forcings, we construct a model of $\aleph_1<\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{b}<\mathrm{non}(\mathcal{M})<\mathrm{cov}(\mathcal{M})=\mathfrak{c}$.
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…
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…
With a loose reference to problems of penetration in biomechanics (for instance, a nanoparticle penetrating through a cell's membrane or a cell sucked with a pipette), the role of configurational forces is investigated during the process in…
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
We consider a class of singular ordinary differential equations describing analytic systems of arbitrary finite dimension, subject to a quasi-periodic forcing term and in the presence of dissipation. We study the existence of response…
We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…
We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.
We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…
We consider a deterministic system with two conserved quantities and infinity many invariant measures. However the systems possess a unique invariant measure when enough stochastic forcing and balancing dissipation are added. We then show…