Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.33718

A note on three-quarters circulant digraphs

C. Dalfó·M. A. Fiol·M. A. Reyes
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce and study a new family of circulant digraphs associated with the cyclic group $\Z_N$, obtained by restricting admissible combinations of two generators $a$ and $b$ to three coordinate sectors. The resulting distance-like function differs from the standard directed distance in circulant digraphs and gives rise to new geometric and combinatorial phenomena. Using planar lattice representations and periodic tessellations, we analyze the growth of reachable sets and derive Moore-type upper bounds for the corresponding order/diameter problem. We construct explicit infinite families of three-quarters circulant structures with the prescribed diameter and provide lattice-based methods for determining admissible generator pairs. Separate constructions are obtained for even and odd diameters. In addition, computational experiments for small and moderate orders suggest improved families for even diameters and motivate a conjectural asymptotic formula for the maximum attainable order. The paper highlights the interplay between constrained lattice representations, periodic tilings, and extremal problems for circulant networks.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. Dalfó, M. A. Fiol, M. A. Reyes. 2026-09-27. A note on three-quarters circulant digraphs. https://arxiv.org/abs/2609.33718

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

KEEP EXPLORING

Related papers

arXiv2026

A power series expansion of the Wilf function

In this work, the author employs the Faà di Bruno formula, identities for the partial Bell polynomials, two combinatorial identities, and the (logarithmically) complete monotonicity of generating functions for several integer sequences, together with the Wronski theorem, to investigate a collection of analytic and combinatorial structures. The study establishes Taylor series expansions for various functions involving the inverse (hyperbolic) tangent function and derives the Maclaurin expansion of the Wilf function, a composite of the inverse tangent, square root, and exponential functions. The coefficients in this expansion are expressed in terms of Stirling numbers of the second kind, and their generating functions, limits, positivity, monotonicity, and logarithmic convexity are analyzed. The paper further presents closed-form formulas for special values of the Gauss hypergeometric function and for certain partial Bell polynomials, along with several infinite series representations of the circular constant and related sequences. An asymptotic rational approximation to the circular constant is recovered, and connections among several integer sequences are established via determinants.

math.CO↗
arXiv2026

Schreier Sets of Intervals, Super-Schreier Sets, and Catalan Numbers

A finite nonempty set $F\subset\mathbb{N}$ is Schreier if $\min F\ge |F|$. First, we prove a linear recurrence relation and compute initial counts for Schreier sets consisting of intervals. Two intervals of integers are separated if their union is not an interval. If $\mathcal J_{k,n}$ is the collection of Schreier sets that are the union of exactly $k$ separated intervals, then the sequence $(|\mathcal{J}_{k,n}|)_{n=1}^\infty$ satisfies the characteristic polynomial $p_k(x) = (x-1)^{2k+1}(x+1)^k$. Furthermore, we introduce the new concept of $k$-super-Schreier sets and let $\mathcal{S}_{k,n}$ denote the collection of $k$-super-Schreier sets whose maximum is $n$. We show that the sequence $(|\mathcal{S}_{k,n}|)_{n=1}^\infty$ satisfies a Fibonacci-type recurrence with a remainder term expressible as a polynomial of $n$.

math.CO↗