相关论文: Reconstructing resurrection
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
This paper considers a recoverable robust single-machine scheduling problem under polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a decision-maker must determine a first-stage schedule subject…
In this paper, we consider sampling and reconstruction of signals in a reproducing kernel subspace of $L^p(\Rd), 1\le p\le \infty$, associated with an idempotent integral operator whose kernel has certain off-diagonal decay and regularity.…
Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…
We prove that the half plane version of the uniform infinite planar triangulation (UIPT) is recurrent. The key ingredients of the proof are a construction of a new full plane extension of the half plane UIPT, based on a natural…
Weighted $\ell_1$-minimization has been studied as a technique for the reconstruction of a sparse signal from compressively sampled measurements when prior information about the signal, in the form of a support estimate, is available. In…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
Results concerning recurrence and ergodicity are proved in an abstract Hilbert space setting based on the proof of Khintchine's recurrence theorem for sets, and on the Hilbert space characterization of ergodicity. These results are carried…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
We fix an excellent regular noetherian scheme $S$ over ${\mathbf Z}_{(p)}$ satisfying a certain finiteness condition. For a constructible \'etale sheaf ${\cal F}$ on a regular scheme $X$ of finite type over $S$, we introduce a variant of…
We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
We introduce a notion of weak definability of first order structures, show that various classification-theoretic properties are or are not preserved under it, and that the properties which are preserved can also be characterized in terms of…
We explore some aspects of "reconstructing" the heavy singlet sector of supersymmetric type I seesaw models, for two, three or four singlets. We work in the limit where one light neutrino is massless. In an ideal world, where selected…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
I propose a scheme for reconstructing the weak value of an observable without the need for weak measurements. The post-selection in weak measurements is replaced by an initial projector measurement. The observable can be measured using any…
In this fourth part, (with the notations of the preceding parts) we make the following hypothesis: $(W,S)$ is a Coxeter system, irreducible, $2$-spherical and $S$ is finite. Let $R:W\to GL(M)$ be a reducible reflection representation of…
We prove that for every infinite set $E\subset \mathbb Z$, there is a set $S\subset E-E$ which is a set of topological recurrence and not a set of measurable recurrence. This extends a result of Igor Kriz, proving that there is a set of…