Related papers: Weak Freiman isomorphisms and sequencings of small…
Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…
This article gives the proof of results announced in [J. Blanc, Finite Abelian subgroups of the Cremona group of the plane, C.R. Acad. Sci. Paris, S\'er. I 344 (2007), 21-26.] and some description of automorphisms of rational surfaces.…
We prove that the C*-algebra of a minimal diffeomorphism satisfies Blackadar's Fundamental Comparability Property for positive elements. This leads to the classification, in terms of K-theory and traces, of the isomorphism classes of…
The isomorphism problem for digraphs is a fundamental problem in graph theory. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer. A digraph admitting a…
In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…
We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…
$2^K$ factorial designs are widely adopted by statisticians and the broader scientific community. In this short note, under the potential outcomes framework (Neyman, 1923; Rubin, 1974), we adopt the partial identification approach and…
In this article, we study the metacyclic p-group codes arising from finite semisimple group algebras. In [CM25], we studied group codes arising from metacyclic groups with order divisible by two distinct odd primes. In the current work, we…
Based on the earlier work of Li (European J. Combin. 1997) and Dobson (Discrete Math. 2008), in this paper we complete the classification of cyclic $m$-DCI-groups and $m$-CI-groups. For a positive integer $m$ such that $m \ge 3$, we show…
We extend Dixmier's construction of singular traces (see \cite{Dixmier}) to arbitrary fully symmetric operator ideals. In fact, we show that the set of Dixmier traces is weak$^*$ dense in the set of all fully symmetric traces (that is,…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
We construct the algebra of fractions of a Weak Bialgebra relative to a suitable denominator set of group-like elements that is `almost central', a condition we introduce in the present article which is sufficient in order to guarantee…
In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…
Let $H$ be a Hilbert space. Using Ball's solution of the "complex plank problem" we prove that the following properties of a sequence $a_n>0$ are equivalent: (1) There is a sequence $x_n \in H$ with $\|x_n\|=a_n$, having 0 as a weak cluster…
In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…
A common fixed point property for semigroups is applied to show that the group algebra $L^1(G)$ of a locally compact group $G$ is $2m$-weakly amenable for each integer $m\geq 1$.
Let $E\subset [0,1]$ be a set that supports a probability measure $\mu$ with the property that $|\widehat{\mu}(t)|\ll (\log |t|)^{-A}$ for some constant $A>2.$ Let $\mathcal{A}=(q_n)_{n\in \N}$ be a positive, real-valued, lacunary sequence.…
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
In this article, we define and explore the weak normalization of an affine semigroup. In particular, for a fixed prime integer, we provide a geometric description of the weak normalization of an affine semigroup with respect to that prime,…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…