Related papers: On Cobweb Posets and Discrete F-Boxes Tilings
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
In this survey we describe a recently-developed technique for bounding the number (and controlling the typical structure) of finite objects with forbidden substructures. This technique exploits a subtle clustering phenomenon exhibited by…
We define for a topological group G and a family of subgroups F two versions for the classifying space for the family F, the G-CW-version E_F(G) and the numerable G-space version J_F(G). They agree if G is discrete, or if G is a Lie group…
Let F be a fixed finite obstruction set of graphs and G be a graph revealed in an online fashion, node by node. The online Delayed F-Node-Deletion Problem (F-Edge-Deletion Problem}) is to keep G free of every H in F by deleting nodes…
Motivated by generalizing Khovanov's categorification of the Jones polynomial, we study functors $F$ from thin posets $P$ to abelian categories $\mathcal{A}$. Such functors $F$ produce cohomology theories $H^*(P,\mathcal{A},F)$. We find…
As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is associated with a…
Given graphs $F$ and $G$, a perfect $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$ that together cover all the vertices in $G$. The study of the minimum degree threshold forcing a perfect $F$-tiling in a graph $G$…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In…
Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the study of real-world graphs, with applications in community detection, pattern recognition, and clustering. A number of effective…
In this paper, we study the dualization in distributive lattices, a generalization of the well-known hypergraph dualization problem. We in particular propose equivalent formulations of the problem in terms of graphs, hypergraphs, and…
\noindent The algebraic characterization of classes of locally isomorphic aperiodic tilings, being examples of quantum spaces, is conducted for a certain type of tilings in a manner proposed by A. Connes. These $2$-dimensional tilings are…
Let f:E-->B be a fibration of fiber F. Eilenberg and Moore have proved that there is a natural isomorphism of vector spaces between H^*(F;F_p) and Tor^{C^*(B)}(C^*(E),F_p). Generalizing the rational case proved by Sullivan, Anick [Hopf…
The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…
We introduce a natural partial order in structurally natural finite subsets the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…
We classify the Fibonacci chains (F-chains) by their index sequences and construct an approximately finite dimensional (AF) $C^*$-algebra on the space of F-chains as Connes did on the space of Penrose tiling. The K-theory on this AF-algebra…
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…
A central question in Arithmetic geometry is to determine for which polynomials $f \in \mathbb{Z}[t]$ and which number fields $K$ the Hasse principle holds for the affine equation $f(t) = N_{K/\mathbb{Q}}(\boldsymbol{x}) \neq 0$. Whilst…