Results 1 to 10 of about 2,889 (232)
Including the Magnitude Variability of a Signal in the Ordinal Pattern Analysis [PDF]
One of the most popular and innovative methods to analyse signals is by using Ordinal Patterns (OPs). The OP encoding is based on transforming a (univariate) signal into a symbolic sequence of OPs, where each OP represents the number of permutations ...
Melvyn Tyloo +2 more
doaj +3 more sources
On k-complementing permutations of cyclically k-complementary graphs
Let \(K_n\) be a complete graph and \(H_1,H_2,\dots,H_k\) its isomorphic factorization where \(k>1\) and \(k\) divides \({1\over 2n} (n-1)\). Let \(\beta\) be a permutation on \(V(K_n)\) such that (by a suitable rearrangement of \(H_i\)) \(\beta: V(H_i)\to V(H_{i+1})\) is an isomorphism for \(i=1,2,\dots,k-1\). Then any isomorphical image of a factor \(
Bernaldez, Jose M.
exaly +4 more sources
Self-complementing permutations of k-uniform hypergraphs [PDF]
Graphs and Algorithms A k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it is isomorphic with its complement (H) over bar = ( V; ((V)(k)) - E). Every permutation sigma of the set V such that sigma(e) is an edge of (H) over bar if and only if e is an element of E is called self-complementing.
Artur Szymański, Adam Pawel Wojda
openaire +4 more sources
Mental wellbeing of university students is a growing concern that has been worsening during the COVID-19 pandemic. Numerous studies have gathered empirical data to explore the mental health impact of the pandemic on university students and investigate ...
Tianhua Chen
doaj +2 more sources
Complementing permutations in finite lattices
AbstractIn a finite lattice L for which the Möbius function is nonvanishing on all upper and lower intervals, we establish the existence of a permutation of L taking each lattice element to one of its complements.
Dowling, Thomas A
openaire +3 more sources
Circularly permuted variants of two CG-specific prokaryotic DNA methyltransferases. [PDF]
The highly similar prokaryotic DNA (cytosine-5) methyltransferases (C5-MTases) M.MpeI and M.SssI share the specificity of eukaryotic C5-MTases (5'-CG), and can be useful research tools in the study of eukaryotic DNA methylation and epigenetic regulation.
Pál Albert +3 more
doaj +2 more sources
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +2 more sources
The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N. +2 more
doaj +2 more sources
Self-complementary hypergraphs and their self-complementing permutations
Abstract A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic with H ′ = ( V ; ( V k ) −
Artur Szymanski, A. Pawel Wojda
exaly +2 more sources
A signature-agnostic test for differences between tumor mutation spectra reveals carcinogen and ancestry effects [PDF]
Despite dozens of tools to identify mutational signatures in cancer samples, there is not an established metric for quantifying whether signature exposures differ significantly between two heterogeneous groups of samples.
Samuel F. M. Hart +3 more
doaj +2 more sources

