Related papers: The First Time KE is Broken up

Let $\mathbf{P}$ be a parabolic subgroup with Levi $\mathbf{M}$ of a connected reductive group defined over a locally compact non-archimedean field $F$. Given a certain compact open subgroup $\Gamma$ of $\mathbf{P}(F)$, this note proves…

For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k}(G)$, has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of $D_{k}(G)$ are adjacent if and only if the dominating set…

Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…

Let $\mathcal{H}=\{H_i: i<\alpha \}$ be an indexed family of graphs for some ordinal number $\alpha$. $\mathcal{H}$-decomposition of a graph $G$ is a family $\mathcal{G}=\{G_i: i<\alpha \}$ of edge-disjoint subgraphs of $G$ such that $G_i$…

In our previous paper we suggested a conjecture relating the structure of the small quantum cohomology ring of a smooth Fano variety to the structure of its derived category of coherent sheaves. Here we generalize this conjecture, make it…

Knowledge graphs (KGs) can provide structured scientific context to language models, but it remains unclear which graph facts actually shape the generated hypotheses. We study KG-guided hypothesis generation for battery materials across…

The independence number $\alpha(G)$ is the cardinality of a maximum independent set, while $\mu(G)$ is the size of a maximum matching in $G$. If $\alpha(G)+\mu(G)$ equals the order of $G$, then $G$ is called a Konig-Egervary graph. The…

In this short paper we show that if $(G,H)$ is an amenable Hecke pair and $\Gamma$ is a subgroup of $G$ containing $H$, then the Hecke pair $(\Gamma, H)$ is amenable too. This answers positively a question of Pierre Eymard, asked in 1972,…

A set S is independent in a graph G if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the size of a maximum matching in G. If alpha(G)+mu(G)=|V|, then…

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

Horizontal visibility graphs (HVGs) are graphs constructed in correspondence with number sequences that have been introduced and explored recently in the context of graph-theoretical time series analysis. In most of the cases simple…

The Kernel Complex Lemma states that given commutative diagram with exact rows and exact columns which covers the region under a $\Gamma$-shape, then the kernel sequence on the top and the kernel sequence at the left have in each position…

For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

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…

The goal of representation learning of knowledge graph is to encode both entities and relations into a low-dimensional embedding spaces. Many recent works have demonstrated the benefits of knowledge graph embedding on knowledge graph…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

Let $H$ be a fixed graph. A {\em fractional $H$-decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G)$, the sum of the weights of copies of $H$ containing $e$…

The Hecke category is emerging as a fundamental object in representation theory. We give a motivated introduction to this category in both its geometric (via parity sheaves) and diagrammatic (generators and relations) incarnations. We also…

Let A be a topological space which is not finitely generated and CH(A) denote the coreflective hull of A in Top. We construct a generator of the coreflective subcategory SCH(A) consisting of all subspaces of spaces from CH(A) which is a…