Results 11 to 20 of about 4,243 (207)

Permutation statistics related to a class of noncommutative symmetric functions and generalizations of the Genocchi numbers [PDF]

open access: yes, 2009
International audienceWe prove conjectures of the third author [L. Tevlin, Proc. FPSAC'07, Tianjin] on two new bases of noncommutative symmetric functions: the transition matrices from the ribbon basis have nonnegative integral coefficients. This is done
Thibon, Jean-Yves   +2 more
core   +1 more source

Flavors of the Fubini-Bruhat Order [PDF]

open access: yes, 2022
Thesis (Ph.D.)--University of Washington, 2022Fubini words are generalized permutations, allowing for repeated letters, and theyare in one-to-one correspondence with ordered set partitions.
Ryan, Stark
core  

S1 Text - [PDF]

open access: yes, 2022
Fig A. Neural correlates of visual and auditory word similarity. Visual word similarity, as modelled by the early layers of the an AlexNet DNN (here: layer 3) predicted activations in bilateral posterior visual cortex, including fusiform cortex (866 ...
Daniel Kaiser (1651843)   +2 more
core   +1 more source

Trace-positive polynomials and the quartic tracial moment problem Polynômes avec une trace positive et le problème quartique des moments traciaux [PDF]

open access: yes, 2010
International audienceThe tracial analog of Hilbert's classical result on positive binary quartics is presented: a trace-positive bivariate noncommutative polynomial of degree at most four is a sum of hermitian squares and commutators.
Burgdorf, Sabine, Klep, Igor
core   +1 more source

Trace-positive polynomials and the quartic tracial moment problem [PDF]

open access: yes, 2010
The tracial analog of Hilbert's classical result on positive binary quartics is presented: a trace-positive bivariate noncommutative polynomial of degree at most four is a sum of hermitian squares and commutators.This is applied via duality to ...
Burgdorf, Sabine   +3 more
core   +1 more source

Word-representability of split graphs generated by morphisms [PDF]

open access: yes, 2022
A graph G=(V,E) is word-representable if and only if there exists a word w over the alphabet V such that letters x and y, x≠y, alternate in w if and only if xy∈E.
Iamthong, Kittitat
core  

Pattern avoidance in partial permutations [PDF]

open access: yes, 2010
Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ...
Claesson, A.   +7 more
core  

Encoding graphs by words and morphisms [PDF]

open access: yes
This thesis is related to encoding graphs by words, where we deal with so called word representation of graphs, relevant to them semi-transitive orientations, and more exotic ways to represent graphs via bijections with certain words and pattern-avoiding
Iamthong, Kittitat
core   +2 more sources

Counting with symmetric functions [PDF]

open access: yes, 2015
This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics.  It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout,
Remmel, Jeffrey, Mendes, Anthony
core   +1 more source

Effectiveness of rTMS on Working Memory and Inhibitory Impairments in Patients With Post‐Stroke Executive Deficits

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao   +6 more
wiley   +1 more source

Home - About - Disclaimer - Privacy