惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

J
Java Code Geeks
Google DeepMind News
Google DeepMind News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
T
The Blog of Author Tim Ferriss
A
About on SuperTechFans
N
Netflix TechBlog - Medium
阮一峰的网络日志
阮一峰的网络日志
H
Help Net Security
I
InfoQ
月光博客
月光博客
量子位
Blog — PlanetScale
Blog — PlanetScale
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
云风的 BLOG
云风的 BLOG
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Jina AI
Jina AI
Engineering at Meta
Engineering at Meta
G
Google Developers Blog
D
DataBreaches.Net
宝玉的分享
宝玉的分享
V
Visual Studio Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
人人都是产品经理
人人都是产品经理

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Solving Admissibility for the Spatial X-Ray Transform On ...
Mihika Dusad · 2025-12-13 · via math.CO updates on arXiv.org

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.