Related papers: Characterizing completely regular codes from an al…

We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a…

We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the…

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

Piecewise quasipolynomial growth of Presburger counting functions combines with tame persistent homology module theory to conclude piecewise quasipolynomial behavior of constructible families of finely graded modules over constructible…

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

We developed an analytic theory of inhomogeneous superconducting pairing in strongly disordered materials, which are moderately close to superconducting-insulator transition. Single-electron eigenstates are assumed to be Anderson-localized,…

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study…

We introduce a generalization of classical $q$-ary codes by allowing points to cover other points that are Hamming distance $1$ or $2$ in a freely chosen subset of all directions. More specifically, we generalize the notion of $1$-covering,…

Algebraic cycles on complex projective space P(V) are known to have beautiful and surprising properties. Therefore, when V carries a real or quaternionic structure, it is natural to ask for the properties of the groups of real or…

Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi. In this paper we set out a…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Let $(Q,\mathfrak{n})$ be a regular local ring of dimension $c \geq 2$ with algebraically closed residue field $k = Q/\mathfrak{n}$. Let $f_1, f_2, \ldots f_{c-1}, g$ be a regular sequence in $Q$ such that $ f_i \in \mathfrak{n}^2$ for all…

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

Let $V$ denote a vector space with finite positive dimension. We consider an ordered pair of linear transformations $A: V\rightarrow V$ and $A^*: V\rightarrow V$ that satisfy (i) and (ii) below. (i) There exists a basis for $V$ with respect…

Let (A,B) and (C,D) denote Leonard pairs on V. We say these pairs are adjacent whenever each basis for V which is standard for (A,B) (resp. (C,D)) is split for (C,D) (resp. (A,B)). Our main results are as follows: Theorem 1. There exists at…

A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…

There exists a biderivation structure on the polynomial algebra $\mathscr{A}[n] = K[x_1,\dots,x_n],$ where $K$ is a field with $\operatorname{char}(K)\ne 2$, defined by $f \circ h = \sum_{i=1}^n \frac{\partial f}{\partial…

We investigate the adjacency matrices of zero-divisor graphs derived from Lipschitz quaternion rings modulo \(n\). For odd primes \(p\), utilizing the isomorphism \(\LL_p\cong M_2(\F_p)\), we categorize vertices by kernel-image type and…

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…