Related papers: Character Values of Stanley Sequences

We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…

Stylometry is mostly applied to authorial style. Recently, researchers have begun investigating the style of characters, finding that the variation remains within authorial bounds. We address the stylistic distinctiveness of characters in…

Quasi-characters are vector-valued modular functions having an integral, but not necessarily positive, q-expansion. Using modular differential equations, a complete classification has been provided in arXiv:1810.09472 for the case of two…

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

Given a finite set of nonnegative integers A with no 3-term arithmetic progressions, the Stanley sequence generated by A, denoted S(A), is the infinite set created by beginning with A and then greedily including strictly larger integers…

Robinson showed that the character degrees are determined by knowing, for all $n$, the number of ways that the identity can be expressed as a product of $n$ commutators. Earlier, Strunkov showed that the existence of characters of…

We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

According to McKay (1980) the irreducible characters of finite subgroups of SU(2) are in a natural 1-1 correspondence with the extended Coxeter-Dynkin graphs of type ADE. We show that the character values themselves can be given by an…

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

An irreducible character $\chi$ of an association scheme is called nonlinear if the multiplicity of $\chi$ is greater than $1$. The main result of this paper gives a characterization of commutative association schemes with at most two…

We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…

Recent advances in text-to-image generation models have unlocked vast potential for visual creativity. However, the users that use these models struggle with the generation of consistent characters, a crucial aspect for numerous real-world…

R. Stanley has found a nice combinatorial formula for characters of irreducible representations of the symmetric group of rectangular shape. Then, he has given a conjectural generalisation for any shape. Here, we will prove this formula…

Stanley introduced expressions for the normalized characters of the symmetric group and stated some positivity conjectures for these expressions. Here, we give an affirmative partial answer to Stanley's positivity conjectures about the…

Sequential identity consistency under precise transient attribute control remains a long-standing challenge in controllable visual storytelling. Existing datasets lack sufficient fidelity and fail to disentangle stable identities from…

We study a spectral problem related to the finite-dimensional characters of the groups $Sp(2N)$, $SO(2N+1)$, and $SO(2N)$, which form the classical series $C$, $B$, and $D$, respectively. The irreducible characters of these three series are…