Results 201 to 210 of about 111,857 (228)

A note on t-complementing permutations for graphs

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek   +4 more
exaly   +3 more sources

Permutation inference for the general linear model [PDF]

NeuroImage, 2014
Permutation methods can provide exact control of false positives and allow the use of non-standard statistics, making only weak assumptions about the data.
Stephen Smith, Anderson Winkler, Thomas E Nichols   +2 more
exaly   +2 more sources

Fuzzy permutation graph and its complements

Journal of Intelligent & Fuzzy Systems, 2018
This paper deals with fuzzy permutation graph which is introduced as a fuzzified model of a crisp permutation graph. We have defined two types of complements of a fuzzy permutation graph viz. p -complement and f -complement.
Sreenanda Raut, Madhumangal Pal, Ganesh Ghorai   +2 more
openaire   +2 more sources

Complement Polyvalence and Permutation in English

Journal of Logic, Language and Information, 2014
In this paper, I address the problem wherein the same English word permits one of its complement positions to be satisfied by phrases of different categories. A well-known example of such an English word is the copula to be, whose complements include adjective phrases, noun phrases, prepositional phrases and adverbial phrases.
openaire   +2 more sources

Circular permutation of E. coli EPSP synthase: increased inhibitor resistance, improved catalytic activity, and an indicator for protein fragment complementation

Chem. Commun., 2014
Circular permutation can increase an enzyme's inhibitor resistance and is a good indicator for establishing protein fragment complementation.
Xiongfeng, Dai, Manlu, Zhu, Yi-Ping, Wang   +2 more
openaire   +2 more sources

Congestion-free Routings of Linear Complement Permutations

SIAM Journal on Discrete Mathematics, 1998
We present an off-line method for routing a linear complement permutation on a hypercube. The routing has the virtue of being congestion-free. Our method is purely algebraic, and the routing involves row reducing an invertible matrix to the identity by means of special row operations.
openaire   +2 more sources

Disjoint permutation matrices in complements of trees

Linear and Multilinear Algebra, 1979
The largest number of disjoint permutation matrices in the complement of a tree matrix is ...
openaire   +1 more source

Lehmer Codes and the Reverse-Complement Mapping from (32-1)-Avoiding Permutations to (3-21)-Avoiding Permutations

Let $S_n(32\text{-}1)$ and $S_n(3\text{-}21)$ denote the sets of $n$-permutations avoiding the vincular patterns $32\text{-}1$ and $3\text{-}21$, respectively. Using Lehmer codes, we realize these families as weighted posets $L_n(32\text{-}1)$ and $L_n(3\text{-}21)$, where the weight of a code is the inversion number of its permutation.
Beveridge, Andrew, Hu, Yufan, Liu, Yucheng   +2 more
openaire   +1 more source

On the existence of a stable complementing permutation in a \(t\)-sc graph

Ars Comb., 1996
The paper deals with the problem of the decomposition of a complete graph into isomorphic factors. This problem is introduced as a generalization of a self-complementary graph, and called a {\(t\)-sc graph} (\(t\) is the number of factors). A \(t\)-sc graph has a {stable self-complementing permutation} \(\pi \) if all its factors are obtained by ...
openaire   +2 more sources