Related papers: On C.T.C. Wall's suspension theorem
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…
This paper uncovers a simple but rather surprising connection: it shows that the well-known convex-concave procedure (CCCP) and its generalization to constrained problems are both special cases of the Frank-Wolfe (FW) method. This…
Let L be a countable and locally finite CW complex. Suppose that the class of all metrizable compacta of extension dimension not greater than L contains a universal element which is an absolute extensor in dimension L. Our main result shows…
A strictly stationary sequence of random variables is constructed with the following properties: (i) the random variables take the values -1 and +1 with probability 1/2 each, (ii) every five of the random variables are independent, (iii)…
A simple construction of Euclidean invariant and reflection positive measures on the cylindrical compactification is performed under a weaker hypothesis than has recently been obtained. Moreover, the results are extended to the case when…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…
We introduce and discuss the concept of modular entanglement. This is the entanglement that is established between the end points of modular systems composed by sets of interacting moduli of arbitrarily fixed size. We show that end-to-end…
These notes derive a number of technical results on nonlinear contraction theory, a comparatively recent tool for system stability analysis. In particular, they provide new results on the preservation of contraction through system…
Topology has appeared in different physical contexts. The most prominent application is topologically protected edge transport in condensed matter physics. The Chern number, the topological invariant of gapped Bloch Hamiltonians, is an…
In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…
This is a philosophical paper. It claims that there is a gap to be filled in the relationship between complexity theory (CT) and quantum theory (QT). This gap concerns two very distinct understandings of time. The paper provides the ground…
We prove a polynomial bound in the "true complexity" problem of Gowers and Wolf. The proof uses only repeated applications of the Cauchy--Schwarz inequality, answering negatively a question posed by Gowers and Wolf. To choose and reason…
A classical theorem of P. McMullen describes all valuations on polytopes that are invariant under translations and weakly continuous, i.e., continuous with respect to parallel displacements of the facets of a polytope. While it is typically…
The Theory of Functional Connections (TFC) is a functional interpolation framework founded upon the so-called constrained expression: a functional that expresses the family of all possible functions that satisfy some user-specified, linear…
Holographic algorithms are a recent breakthrough in computer science and has found applications in information theory. This paper provides a proof to the central component of holographic algorithms, namely, the Holant theorem. Compared with…
We study a notion of tight inclusions of C*- and W*-dynamical systems which is meant to capture a tension between topological and measurable rigidity of boundary actions. An important case of such inclusions are $C(X)\subset L^\infty(X,…
Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.