Search arXivSearch

arXiv · 2512.12215

Solving Admissibility for the Spatial X-Ray Transform On the Two Element Field

Abstract

The admissibility problem in integral geometry asks for which collections of affine subspaces the Radon transform remains injective. In the discrete setting, this becomes a purely combinatorial question about recovering a function on a finite vector space from its sums over a prescribed family of affine subspaces. In this paper, we study the spatial X-ray transform (line transform) over the finite vector spaces $\mathbb{Z}_{2}^{n}$ and give a complete structural and enumerative description of admissible line complexes in $\mathbb{Z}_{2}^{4}$. We prove that any admissible line complex in $\mathbb{Z}_{2}^{4}$ can be obtained by taking a disjoint union of one or more odd cycles and attaching trees to the cycle vertices. Using this structural description, we carry out a systematic case-by-case enumeration of all admissible complexes in $\mathbb{Z}_{2}^{4}$ and derive an exact total count. We then generalize our approach to an algorithm that applies to $\mathbb{Z}_{2}^{n}$ for arbitrary $n$, and we then implement it to obtain the total number of admissible complexes in $\mathbb{Z}_{2}^{5}$. Our results extend previous small-dimensional classifications and provide an algorithmic framework for studying admissibility in higher dimensions. Beyond their intrinsic combinatorial interest, these structures model discrete sampling schemes for tomographic imaging, and they suggest further connections between admissibility, incidence matrices, and spectral properties of the associated graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mihika Dusad. 2025-12-13. Solving Admissibility for the Spatial X-Ray Transform On the Two Element Field. https://arxiv.org/abs/2512.12215

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO