Related papers: RTD-Conjecture and Concept Classes Induced by Grap…
We study for rationally connected varieties $X$ the group of degree 2 integral homology classes on $X$ modulo those which are algebraic. We show that the Tate conjecture for divisor classes on surfaces defined over finite fields implies…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the…
By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…
In human cognition, the expansion of perceived between-category distances and compression of within-category distances is known as categorical perception (CP). There are several hypotheses about the causes of CP (e.g., language, learning,…
In this paper we prove that the inductively defined graph dimension has a simple additive property under the join operation. The dimension of the join of two simple graphs is one plus the sum of the dimensions of the component graphs:…
In this paper we consider the class of graphs which are redundantly $d$-rigid and $(d+1)$-connected but not globally $d$-rigid, where $d$ is the dimension. This class arises from counterexamples to a conjecture by Bruce Hendrickson. It…
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and…
Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices,…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
For a simple graph $G$, denote by $n$, $\Delta(G)$, and $\chi'(G)$ its order, maximum degree, and chromatic index, respectively. A connected class 2 graph $G$ is edge-chromatic critical if $\chi'(G-e)<\Delta(G)+1$ for every edge $e$ of $G$.…
Let $G$ be a graph and $U\subset V(G)$ be a set of vertices. For each $v\in U$, let $h_v\colon U\to \{0, 1\}$ be the function defined by \[h_v(u)=\begin{cases} &1 ~\mbox{if}~u\sim v, u\in U\\&0 ~\mbox{if}~u\not\sim v, u\in U\end{cases},\]…
A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…
We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called…
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…
Graph-structured data such as social networks, functional brain networks, gene regulatory networks, communications networks have brought the interest in generalizing deep learning techniques to graph domains. In this paper, we are…
Traditional knowledge graphs are constrained by fixed ontologies that organize concepts within rigid hierarchical structures. The root cause lies in treating domains as implicit context rather than as explicit, reasoning-level components.…
Hadwiger's conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwiger's conjecture is true for line graphs. We investigate this conjecture on the closely related…
We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…