Related papers: The Relation between Composability and Splittabili…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

An r.e. set $A$ is speedable if for every recursive function, there exists a program enumerating membership in $A$ faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into…

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

Consider a unital C*-algebra A, a von Neumann algebra M, a unital sub-C*-algebra C of A and a unital *-homomorphism $\pi$ from C to M. Let u: A --> M be a decomposable map (i.e. a linear combination of completely positive maps) which is a…

Rank $1$ modules are the building blocks of the category ${\rm CM}(B_{k,n}) $ of Cohen-Macaulay modules over a quotient $B_{k,n}$ of a preprojective algebra of affine type $A$. Jensen, King and Su showed in \cite{JKS16} that the category…

The (classical) problem of characterizing and enumerating permutations that can be sorted using two stacks connected in series is still largely open. In the present paper we address a related problem, in which we impose restrictions both on…

For any complex number $c$, define the divisor function $\sigma_c\colon\mathbb N\to\mathbb C$ by $\displaystyle\sigma_c(n)=\sum_{d\mid n}d^c$. Let $\overline{\sigma_c(\mathbb N)}$ denote the topological closure of the range of $\sigma_c$.…

A cohomological criterion for the complete reducibility of modules of finite length satisfying a composability condition for a meromorphic open-string vertex algebra $V$ has been given by Qi and the author. In order to apply this criterion,…

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

In this paper, by considering two non-isospectral problems with matrices chosen on the color Lie algebra $\mathfrak{sp}_{1}(6)$, we construct (1+1)-dimensional and (2+1)-dimensional super integrable systems on $\mathfrak{sp}_{1}(6)$.…

A graph $G$ is said to be equitably $c$-colorable if its vertices can be partitioned into $c$ independent sets that pairwise differ in size by at most one. Chen, Lih, and Wu conjectured that every connected graph $G$ with maximum degree…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$. Let $J_G(\alpha)$ denote the set of all commutators $[x,\alpha]$, where $x$ belongs to an $\alpha$-invariant Sylow subgroup of $G$. We show that $[G,\alpha]$ is soluble or…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

A $k$-coloring of a graph $G=(V,E)$ is called semi-equitable if there exists a partition of its vertex set into independent subsets $V_1,\ldots,V_k$ in such a way that $|V_1| \notin \{\lceil |V|/k\rceil, \lfloor |V|/k \rfloor\}$ and…

We characterize some classes of finite soluble groups. In particular, we prove that: a finite group $G$ is supersoluble if and only if $G$ has a normal subgroup $D$ such that $G/D$ is supersoluble and $D$ avoids every chief factor of $G$…

Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…

A divisibility relation on ultrafilters on the set $\mathbb{N}$ of natural numbers is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also…