arXiv subjects

David V. Feldman

Publications and source records attributed to David V. Feldman.

4 recordsLinked to original sources

arXiv2026

A Note on Compactness and Clique Size

Say that a topological space $X$ has finite, respectively bounded, cliques iff every closed, irreflexive binary relation --- equivalently, every closed, loop-free directed graph --- on $X$ has cliques of finite, respectively bounded finite, size. Every compact space has bounded cliques. Having finite cliques implies limit-point compactness, and is implied by $\omega$-limit point compactness (equivalently, countable compactness). Thus, for $T_1$ spaces, having finite cliques is equivalent to countable compactness. Having bounded cliques is strictly weaker than compactness. Indeed, any space $X$ such that $X^{\omega}$ is countably compact has bounded cliques. However, we have found no example of a countably compact space having finite but unbounded cliques. The existence of such a space is the major open problem raised in this note.

math.GN↗

arXiv2017

Admissible Complexes for the Projective X-Ray Transform over a Finite Field

We consider the X-ray transform in a projective space over a finite field. It is well known (after E. Bolker) that this transform is injective. We formulate an analog of I.M. Gelfand's admissibility problem for the Radon transform, which asks for a classification of all minimal sets of lines for which the restricted Radon transform is injective. The solution involves doubly ruled quadric surfaces.

math.MG↗

arXiv2008

Angles as probabilities

We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a tetrahedron T, divided by 2*pi, gives the probability that an orthogonal projection of T onto a random 2-plane is a triangle. More generally, it is shown that the sum of the (solid) inner vertex angles of an n-simplex S, normalized by the area of the unit (n-1)-hemisphere, gives the probability that an orthogonal projection of S onto a random hyperplane is an (n-1)-simplex. Applications to more general polytopes are treated briefly, as is the related Perles-Shephard proof of the classical Gram-Euler relations.

math.MG↗

arXiv1997

Hyperentangled States

We investigate a new class of entangled states, which we call 'hyperentangled',that have EPR correlations identical to those in the vacuum state of a relativistic quantum field. We show that whenever hyperentangled states exist in any quantum theory, they are dense in its state space. We also give prescriptions for constructing hyperentangled states that involve an arbitrarily large collection of systems.

quant-ph↗