Results 51 to 60 of about 8,473 (239)
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
Mathematische Nachrichten, EarlyView.ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source
, 1984 Koopman Hilda, Sportiche Dominique. Le principe de bijection. In: Communications, 40, 1984. Grammaire générative et sémantique, sous la direction de Pierre Jacob. pp.
Sportiche, Dominique, Koopman, Hilda
core +1 more source
On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)
Networks, EarlyView.ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs +2 more
wiley +1 more source
A Bijection between Maximal Chains in Fibonacci Posets [PDF]
, 1997 We give a bijection between maximal 0→wchains in the Fibonacci lattices, Fib(r) andZ(r), and interpret this bijection in terms of ...
Kremer, Darla, O'Hara, Kathleen M.
core +1 more source
A bijection for partitions simultaneously s-regular and t-distinct
, 2023 In this note a bijection is constructed between the set of partitions of $n$ simultaneously $s$-regular and $t$-distinct, and those simultaneously $t$-regular and $s$-distinct. Some implications of the map are discussed.
Keith, William J.
core +1 more source
Artificial Intelligence for Engineering, EarlyView.We present a three‐stage training framework combining Behaviour Cloning warm‐starting with auxiliary‐regularised Deep Reinforcement Learning PPO fine‐tuning for 2D drone waypoint navigation under stochastic wind. Persistent imitation regularisation prevents catastrophic forgetting, achieving robust generalisation to unseen targets and out‐of ...
Ahmet Bilgehan Serçe, Necati Aksoy
wiley +1 more source
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
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
Bijections for Entringer families
European Journal of Combinatorics, 2011 André proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of André's result was given by Entringer, who proved that counting alternating permutations according to the first element gives rise to Seidel's triangle $(E_{n,k})$ for computing the Euler numbers.
Gelineau, Yoann +2 more
openaire +5 more sources