A decomposition into boxes that determine the Kernel of a staircase starshaped set in \(\mathbb{R}^d\)

Let \( S \) be a connected union of finitely many \( d \)-dimensional boxes in \( \mathbb{R}^d \) and let \( \mathcal{B} \) represent the family of boxes determined by facet hyperplanes for \( S \), with \( \mathcal{F} \) the associated family of faces (including members of \( \mathcal{B} \)). For set \( F \) in \( \mathcal{F} \), point \( x \) relatively interior to \( F \), and point \( y \) in \( S \), \( x \) sees \( y \) via staircase paths in \( S \) if and only if every point of \( F \) sees \( y \) via such paths. Thus the visibility set of \( x \) is a union of members of \( \mathcal{F} \), as is the staircase kernel of \( S \). A similar result holds for \( k \)-staircase paths in \( S \) and the \( k \)-staircase kernel of \( S \).

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-03-19
DOI
https://doi.org/10.61091/jcmcc124-49
Primary Topic
advanced mathematical theories
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A decomposition into boxes that determine the Kernel of a staircase starshaped set in \(\mathbb{R}^d\)

Marilyn Breen
Journal of Combinatorial Mathematics and Combinatorial Computing
advanced mathematical theories
article

A decomposition into boxes that determine the Kernel of a staircase starshaped set in \(\mathbb{R}^d\)

Marilyn Breen
article en

Abstract

Let \( S \) be a connected union of finitely many \( d \)-dimensional boxes in \( \mathbb{R}^d \) and let \( \mathcal{B} \) represent the family of boxes determined by facet hyperplanes for \( S \), with \( \mathcal{F} \) the associated family of faces (including members of \( \mathcal{B} \)). For set \( F \) in \( \mathcal{F} \), point \( x \) relatively interior to \( F \), and point \( y \) in \( S \), \( x \) sees \( y \) via staircase paths in \( S \) if and only if every point of \( F \) sees \( y \) via such paths. Thus the visibility set of \( x \) is a union of members of \( \mathcal{F} \), as is the staircase kernel of \( S \). A similar result holds for \( k \)-staircase paths in \( S \) and the \( k \)-staircase kernel of \( S \).

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 124
Openalex Percentile: Top 90%
advanced mathematical theories
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.