Method for Counting the Number of Interior Points of the Standard Arrangement of the Discrete Torus

In this paper, we consider an n-dimensional torus with generating cycles of even length and present a method for calculating the number of interior points of standard arrangements.

Authors

Publication Details

Published
2025-09-21
DOI
https://doi.org/10.51408/csit2025_25
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Method for Counting the Number of Interior Points of the Standard Arrangement of the Discrete Torus

Vilik Karakhanyan
Graph Theory and Algorithms
article

Method for Counting the Number of Interior Points of the Standard Arrangement of the Discrete Torus

Vilik Karakhanyan
article en

Abstract

In this paper, we consider an n-dimensional torus with generating cycles of even length and present a method for calculating the number of interior points of standard arrangements.

Openalex Percentile: Top 74%
Graph Theory and Algorithms
DOIOpen Access PDFOpenAlex
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.

Method for Counting the Number of Interior Points of the Standard Arrangement of the Discrete Torus — Vilik Karakhanyan · (2025) | TGRS Research Map | TGRS