Results 51 to 60 of about 8,688 (230)
A Structural Description of Zykov and Blanche Descartes Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangle‐free graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin +3 more
wiley +1 more source
A Bijection for Enriched Trees
European Journal of Combinatorics, 1994 The author establishes a bijection involving species of enriched trees that leads to a combinatorial proof of Lagrange's inversion formula.
openaire +3 more sources
Almost Periodicity on Isolated Time Scales and Applications
Mathematische Nachrichten, EarlyView.ABSTRACT In this work, we formulate a generalized definition of almost periodicity for functions defined on isolated time scales. The introduced definition is consistent with the known formulations in the discrete and quantum calculus settings. We state two different definitions of almost periodicity and we show their relation.
Martin Bohner +2 more
wiley +1 more source
Type Dn(1) rigged configuration bijection
, 2016 We establish a bijection between the set of rigged configurations and the set of tensor products of Kirillov–Reshetikhin crystals of type Dn(1) in full generality.
Scrimshaw, Travis +11 more
core +1 more source
On the Global Asymptotic Stability of an Infection‐Age‐Structured Competitive Model
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT We investigate an infection‐age‐structured competitive epidemiological model involving multiple strains. While classical results establish competitive exclusion when a unique maximal basic reproduction number exists, we provide here a complete characterization of the asymptotic behavior for an arbitrary number of populations without assuming ...
S. Girel, Q. Richard
wiley +1 more source
A natural bijection for contiguous pattern avoidance in words [PDF]
, 2023 Two words $p$ and $q$ are avoided by the same number of length-$n$ words, for all $n$, precisely when $p$ and $q$ have the same set of border lengths. Previous proofs of this theorem use generating functions but do not provide an explicit bijection.
Rowland, Eric +2 more
core +1 more source
Une bijection simple pour les cartes orientables
, 2001 Rapport interne.Cori et Vauquelin ont montré que les cartes planaires pointées sont en bijection avec les arbres bien étiquetés. Dans le présent article, nous présentons une bijection plus simple dans ce cas planaire et qui s'étend en genre supérieur. De
Marcus, Michel, Schaeffer, Gilles
core +3 more sources
Enumeration of Corners in Tree-like Tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative ...
Alice L. L. Gao +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1981 AbstractIn this paper we give a bijection between the partitions of n with parts congruent to 1 or 4 (mod 5) and the partitions of n with parts differing by at least 2. This bijection is obtained by a cut-and-paste procedure which starts with a partition in one class and ends with a partition in the other class.
Adriano M. Garsia, Stephen C. Milne
openaire +2 more sources
DrLS: Distortion‐Resistant Lossless Steganography via Colour Depth Interpolation
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The lossless data steganography is to hide a certain amount of information into a container image. Previous lossless steganography methods fail to strike a balance between capacity, imperceptibility, accuracy, and robustness, commonly vulnerable to distortion on container images.
Youmin Xu +3 more
wiley +1 more source