Related papers: Constructing generalized Heffter arrays via near a…

Terwilliger algebras are a subalgebra of a matrix algebra that are constructed from association schemes over finite sets. In 2010, Rie Tanaka defined what it means for a Terwilliger algebra to be almost commutative. In that paper she gave…

Associated to every complex reflection group, we construct a lattice of quotients of its braid monoid-algebra, which we term nil-Hecke algebras, and which are obtained by killing all braid words that are "sufficiently long", as well as some…

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function…

This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…

Given a square matrix with elements in the group-ring of a group, one can consider the sequence formed by the trace (in the sense of the group-ring) of its powers. We prove that the corresponding generating series is an algebraic…

We develop a general theory for irreducible homogeneous spaces $M= G/H$, in relation to the nullity $\nu$ of their curvature tensor. We construct natural invariant (different and increasing) distributions associated with the nullity, that…

We associate with every Renner monoid $R$ a \emph{generic Hecke algebra} $\H(R)$ over $\mathbb{Z}[q]$ which is a deformation of the monoid $\mathbb{Z}$-algebra of $R$. If $M$ is a finite reductive monoid with Borel subgroup $B$ and…

Let $H$ be an infinite-dimensional Hilbert space. We prove that every unconditional Schauder frame for $H$ contains a subsequence that can be normalized to form a frame for $H$. As a consequence, every semi-normalized unconditional Schauder…

Given a non-necessarily commutative unital ring $R$ and a unital partial representation $\Theta $ of a group $G$ into the Picard semigroup $\mathbf{PicS} (R)$ of the isomorphism classes of partially invertible $R$-bimodules, we construct an…

We construct new families of completely regular codes by concatenation methods. By combining parity check matrices of cyclic Hamming codes, we obtain families of completely regular codes. In all cases, we compute the intersection array of…

Let $G$ be a finite group and let $h$ be a positive integer. A $\text{BH}(G,h)$ matrix is a $G$-invariant $|G|\times |G|$ matrix $H$ whose entries are complex $h$th roots of unity such that $HH^*=|G|I_{|G|}$, where $H^*$ denotes the complex…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

We analzye Rieffel's construction of generalized fixed point algebras in the setting of group actions on Hilbert modules. Let G be a locally compact group acting on a C*-algebra B. We construct a Hilbert module F over the reduced crossed…

In this paper we are concerned with the simplest normal form computation of a family of Hopf-zero vector fields without a first integral. This family of vector fields are the classical normal forms of a larger family of vector fields with…

Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A(\Gamma)$ is singular. The singularity of graphs is of certain interest in graph theory and algebraic combinatorics. Here we…

In this paper, we consider homological properties of so-called graph ideals. Consider $\Gamma$ is a graph with vertices $t_1$, ..., $t_s$, without self-loops and multiple adjacencies. We can associate with such a graph an ideal…

Let $x_1,...,x_n$ be a list of real numbers, let $s :=\sum_{i=1}^{n}x_i$ and let $h:\mathbb{N} \rightarrow \mathbb{R}$ be a function. We gave a necessary and sufficient condition for $s>h(n)$ (respectively, $s<h(n)$). Let $G=(V,E)$ be a…

A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and \binom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the following family of simplicial complexes. Let n,k be integers…