Related papers: Statistically characterized subgroups related to s…
Applying the embedding of $A_{n-1}$ in $B_n$, $C_n$ and $D_n$ we construct a new supercharacter theory for the Sylow subgroups in orthogonal and symplectic groups over a finite field. The constructed supercharacter appears to be a little…
An encoding of directed acyclic graphs (DAGs) on labeled vertices is proposed, which is a generalisation of the Pr\"ufer code for labeled trees, if a certain orienation on the edges of the tree is introduced. Hence it is shown that the…
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…
For a non-decreasing sequence of positive integers $S=(s_1,s_2,\ldots)$, the $S$-packing chromatic number of a graph $G$ is denoted by $\chi_S(G)$. In this paper, $\chi_S$-critical graphs are introduced as the graphs $G$ such that…
We are interested in the statistics of the length of the longest increasing subsequence of 2-rowed lexicographically sorted arrays chosen according to distinct families of distributions D = (D_n)_n, and when n goes to infinity. This…
How does neural connectivity in autistic children differ from neural connectivity in healthy children or autistic youths? What patterns in global trade networks are shared across classes of goods, and how do these patterns change over time?…
Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
By classifying $S$-maximal amenable subgroups of algebraic groups over a global field of characteristic zero, we obtain a complete classification of maximal amenable subgroups up to commensurability in the respective arithmetic groups.…
In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the…
This paper presents new results allowing an unknown non-Gaussian positive matrix-valued random field to be identified through a stochastic elliptic boundary value problem, solving a statistical inverse problem. A new general class of…
We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. More precisely, in the family of of $d$-regular graphs, which graph $G$ maximizes/minimizes the…
We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…
We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…
Arithmetical properties of a finite group are properties of the group which are defined by its arithmetical parameters such as the order of the group, the element orders and so on. In this paper, we discuss a number of results on…
In this paper, we study the vanishing-off subgroups of supercharacters, and use these to determine several new characterizations of supercharacter theory products. In particular, we give a character theoretic characterization that allows us…