Authorship attribution in portuguese using character N-grams

For the Authorship Attribution (AA) task, character n-grams are considered among the best predictive features. In the English language, it has also been shown that some types of character n-grams perform better than others. This paper tackles the AA task in Portuguese by examining the performance of different types of character n-grams, and various combinations of them. The paper also experiments with different feature representations and machine-learning algorithms. Moreover, the paper demonstrates that the performance of the character n-gram approach can be improved by fine-tuning the feature set and by appropriately selecting the length and type of character n-grams. This relatively simple and language-independent approach to the AA task outperforms both a bag-of-words baseline and other approaches, using the same corpus.Mexican Government (Conacyt) [240844, 20161958]; Mexican Government (SIP-IPN) [20171813, 20171344, 20172008]; Mexican Government (SNI); Mexican Government (COFAA-IPN)

The 6-vertex model and deformations of the Weyl character formula

We use statistical mechanics -- variants of the six-vertex model in the plane studied by means of the Yang-Baxter equation -- to give new deformations of Weyl's character formula for classical groups of Cartan type B, C, and D, and a character formula of Proctor for type BC. In each case, the corresponding Boltzmann weights are associated to the free fermion point of the six-vertex model. These deformations add to the earlier known examples in types A and C by Tokuyama and Hamel-King, respectively. A special case for classical types recovers deformations of the Weyl denominator formula due to Okada.Comment: v2: renamed the last family of models and showed their connection to character formulae for groups of type BC; addressed some issues in the proof of Lemma 6.2; updated abstrac

Language Functions Used by the Main Character in Sherlock Holmes II: a Game of Shadows Movie

This research focused on language functions used by the main character in “Sherlock Holmes” movie. The aims were to find the use of language functions and describe the dominant types of language functions used in “Sherlock Holmes” movie. The data were the dialogue of the main character in “Sherlock Holmes” movie in the first forty minutes of the movie. The research was conducted by using descriptive qualitative research. The findings show that there are six types of language functions used by the main character in “Sherlock Holmes” movie. They are expressive, directive, referential, metalinguistic, phatic, and poetic. The most dominant type of language function is metalinguistic. It means that the main character conveys code analysis by asking questions to the people so that he might invent clue for the sake of his investigation

On the modularity of reducible mod l Galois representations

We prove that every odd semisimple reducible (2-dimensional) mod l Galois representation arises from a cuspidal eigenform. In addition, we investigate the possible different types (level, weight, character) of such a modular form. When the representation is the direct sum of the trivial character and a power of the mod l cyclotomic character, we are able to characterize the primes that can arise as levels of the associated newforms. As an application, we determine a new explicit lower bound for the highest degree among the fields of coefficients of newforms of trivial Nebentypus and prime level. The bound is valid in a subset of the primes with natural (lower) density at least one half.Comment: Minor modifications. Accepted for publication in Mathematical Research Letter

Characters of Feigin-Stoyanovsky's type subspaces of level one modules for affine Lie algebras of types Aℓ(1)A_\ell^{(1)} and D4(1)D_4^{(1)}

We use combinatorial description of bases of Feigin-Stoyanovsky's type subspaces of standard modules of level 1 for affine Lie algebras of types $A_\ell^{(1)}$ and $D_4^{(1)}$ to obtain character formulas. These descriptions naturally lead to systems of recurrence relations for which we also find solutions