Related papers: Stingray Patterns of Dominant Weights

A direct sum decomposition theory is developed for direct summands (and complements) of modules over a semiring $R$, having the property that $v+w = 0$ implies $v = 0$ and $w = 0$. Although this never occurs when $R$ is a ring, it always…

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

Consider a crystallographic root system together with its Weyl group $W$ acting on the weight lattice $M$. Let $Z[M]^W$ and $S^*(M)^W$ be the $W$-invariant subrings of the integral group ring $Z[M]$ and the symmetric algebra $S^*(M)$…

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

Stochastic symmetries and related invariance properties of finite dimensional SDEs driven by general cadlag semimartingales taking values in Lie groups are defined and investigated. The considered set of SDEs, first introduced by S. Cohen,…

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

We study p-Laplacians and spectral clustering for a recently proposed hypergraph model that incorporates edge-dependent vertex weights (EDVW). These weights can reflect different importance of vertices within a hyperedge, thus conferring…

In this paper we address the problem of classification of simple weight modules over weak generalized Weyl algebras of rank one. The principal difference between weak generalized Weyl algebras and generalized weight algebras is that weak…

We study the algebra of functions on the Iwahori group via the category of graded bounded representations of its Lie algebra. In particular, we identify the standard and costandard objects in this category with certain generalized Weyl…

For the Iwahori-Hecke algebras of type $A$, James and Mathas proved a theorem which relates $v$-decomposition numbers for different values of $e$, by adding empty runners to the James' abacus display. This result is often referred to as the…

We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…

Let $\mathfrak{g}$ be a semisimple complex Lie algebra, and let $W$ be a finite subgroup of $\mathbb{C}$-algebra automorphisms of the enveloping algebra $U(\mathfrak{g})$. We show that the derived category of $U(\mathfrak{g})^W$-modules…

By bivariate irreducible representations of ${\rm Sp}(2r)$, we mean irreducible representations with highest weights containing at most two nonzero entries, using the usual identification of dominant weights for complex symplectic Lie…

We show that $\kgl$-linear cohomology theories over an affine Dedekind scheme $S$ admit a canonical weight filtration on resolvable motives without inverting residual characteristics. Combined with upcoming work of Annala--Hoyois--Iwasa,…

In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…

The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$…

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

Let $\mathcal{H}$ be a hypergraph on a finite set $V$. A {\em cover} of $\mathcal{H}$ is a set of vertices that meets all edges of $\mathcal{H}$. If $W$ is not a cover of $\mathcal{H}$, then $W$ is said to be a {\em noncover} of…