Related papers: Quasi-forest simplicial complexes and almost Cohen…

We characterize the structure of 2-quasi-cyclic codes over a finite field F by the so-called Goursat Lemma. With the characterization, we exhibit a necessary and sufficient condition for a 2-quasi-cyclic code being a dihedral code. And we…

In this paper, we want to control the geometry of some surface subgroups of a cocompact Kleinian group. More precisely, provided any genus-2 quasi-Fuchsian group $\Gamma$ and cocompact Kleinian group $G$, then for any $K>1$, we will find a…

Weak degeneracy of a graph is a variation of degeneracy that has a close relationship to many graph coloring parameters. In this article, we prove that planar graphs with distance of $3$-cycles at least 2 and no cycles of lengths $5, 6, 7$…

Let $\Omega$ be a planar Jordan domain. We consider double-dome-like surfaces $\Sigma$ defined by graphs of functions of $dist( \cdot ,\partial \Omega)$ over $\Omega$. The goal is to find the right conditions on the geometry of the base…

In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…

Let $K_k$, $C_k$, $T_k$, and $P_{k}$ denote a complete graph on $k$ vertices, a cycle on $k$ vertices, a tree on $k+1$ vertices, and a path on $k+1$ vertices, respectively. Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the…

We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…

The arboricity $\Gamma$ of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they only approximated the arboricity as a value without computing a…

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

In attempting to understand how combinatorial modifications alter algebraic properties of monomial ideals, several authors have investigated the process of adding "whiskers" to graphs. In this paper, we study a similar construction to build…

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…

In this paper, we show that almost Cohen-Macaulay algebras are solid and in this respect, we seek for some special situation when (a) an almost Cohen-Macaulay algebra will be phantom extension and (b) when it maps into a balanced big…

We extend the definition of the Kobayashi pseudodistance to almost complex manifolds and show that its familliar properties are for the most part preserved. We also study the automorphism group of an almost complex manifold and finish with…

We notice the connection between almost Cohen-Macaulay rings and the Cohen-Macaulay defect. We introduce a Serre-type condition for modules, that is connected to the Cohen-Macaulay defect in the same way that the condition $(S_n)$ is…

We investigate examples of quasi-spectral triples over two-dimensional commutative sphere, which are obtained by modifying the order-one condition. We find equivariant quasi-Dirac operators and prove that they are in a topologically…

The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…

Let $G$ be a finite abelian group of order $n$ and let $\Delta_{n-1}$ denote the $(n-1)$-simplex on the vertex set $G$. The sum complex $X_{A,k}$ associated to a subset $A \subset G$ and $k < n$, is the $k$-dimensional simplicial complex…

A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the corresponding Cayley graph is a…