Related papers: Congruences in character tables of symmetric group…
For a multi-set $\lambda=\{k_1,k_2, \ldots, k_q\}$ of positive integers, let $k_{\lambda} = \sum_{i=1}^q k_i$. A $\lambda$-list assignment of $G$ is a list assignment $L$ of $G$ such that the colour set $\bigcup_{v \in V(G)}L(v)$ can be…
We obtain asymptotic formulas for the number of matrices in the congruence subgroup \[ \Gamma_0(Q) = \left\{ A\in\mathrm{SL}_2(\mathbb Z):~c \equiv 0 \pmod Q\right\}, \] which are of naive height at most $X$. Our result is uniform in a very…
Given a graph $G$, a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x,y\in V(G)$ with a same color, if there is a shortest $x,y$-path whose internal vertices have different colors than $x,y$. The smallest…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…
Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
Let $\Gamma$ be a $G$-symmetric graph with vertex set $V$. We suppose that $V$ admits a $G$-partition $\mathcal{B} = \{ B_0, ... , B_b \}$, with parts of size $v$, and that the quotient graph induced on $\mathcal B$ is a complete graph of…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…
An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…
A $GL_d$-pseudocharacter is a function from a group $\Gamma$ to a ring $k$ satisfying polynomial relations which make it "look like" the character of a representation. When $k$ is an algebraically closed field, Taylor proved that…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
Let $\FF$ be a finite field and $(Q,\bfd)$ an acyclic valued quiver with associated exchange matrix $\tilde{B}$. We follow Hubery's approach \cite{hub1} to prove our main conjecture of \cite{rupel}: the quantum cluster character gives a…
We show that some types for supercuspidal representations of tamely ramified $p$-adic groups that appear in Jiu-Kang Yu's work are geometrizable. To do so, we define a function-sheaf dictionary for one-dimensional characters of arbitrary…
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
Let us have in S^2, R^2 or H^2 a pair of convex bodies, for S^2 different from S^2, such that the intersections of any congruent copies of them are centrally symmetric. Then our bodies are congruent circles. If the intersections of any…
We show that almost every entry in the character table of $S_N$ is divisible by any fixed prime as $N\to\infty$. This proves a conjecture of Miller.
The purpose of this note is to give an insertion scheme proof of the formula, $$p_\mu = \sum_{\lambda\vdash k} \chi^\lambda(\mu)s_\lambda,\formula$$ where $p_\mu$ is the power sum symmetric function, $s_\lambda$ is the Schur function and…
In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…