Related papers: Character Values of Stanley Sequences

This expository note presents simplifications of a theorem due to Gy\H{o}ri and an algorithm due to Franzblau and Kleitman: Given a family $F$ of $m$ intervals on a linearly ordered set of $n$ elements, we can construct in $O(m+n)^2$ steps…

In representation theory of finite groups an important role is played by irreducible characters of p-defect 0, for a prime p dividing the group order. These are exactly those vanishing at the p-singular elements. In this paper we generalize…

Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…

We show that for any knot there exist only finitely many irreducible metabelian characters in the $SL(2,\mathbb{C})$-character variety of the knot group, and the number is given explicitly by using the determinant of the knot. Then it turns…

We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…

Sequences whose terms are equal to the number of functions with specified properties are considered. Properties are based on the notion of derangements in a more general sense. Several sequences which generalize the standard notion of…

Large-scale dynamical properties of complete chromosome DNA sequences of eukaryotes are considered. By the proposed deterministic models with intermittency and symbolic dynamics we describe a wide spectrum of large-scale patterns inherent…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

Shelstad's character identity is an equality between sums of characters of tempered representations in corresponding $L$-packets of two real, semisimple, linear, algebraic groups that are inner forms to each other. We reconstruct this…

Let $\Gamma$ be a finite simple graph. If for some integer $n\geqslant 4$, $\Gamma$ is a $K_n$-free graph whose complement has an odd cycle of length at least $2n-5$, then we say that $\Gamma$ is an $n$-exact graph. For a finite group $G$,…

A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…

We study some properties of binary sequences generated by random substitutions of constant length. Specifically, assuming the alphabet $\{0,1\}$, we consider the following asymmetric substitution rule of length $k$: $0 \to \langle 0, 0,…

Berkovich, Chillag and Herzog characterized all finite groups $G$ in which all the nonlinear irreducible characters of $G$ have distinct degrees. In this paper we extend this result showing that a similar characterization holds for all…

This paper proposes a conjectural framework for Alperin's Main Problem of Block Theory from 1976. The character sets considered here are defined by nonvanishing at given elements, not only by degree conditions. From this point of view,…

This paper addresses the uniform random generation of words from a context-free language (over an alphabet of size $k$), while constraining every letter to a targeted frequency of occurrence. Our approach consists in a multidimensional…

A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…

We show that certain sums studied in two recent papers are basically character coordinates (as they are called in the literature). These sums involve values of Dirichlet characters and powers of $\cot(\pi k/n)$, $1\le k\le n-1$. We also…

A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Automatic character generation is an appealing solution for new typeface design, especially for Chinese typefaces including over 3700 most commonly-used characters. This task has two main pain points: (i) handwritten characters are usually…