Related papers: Annotating Simplices with a Homology Basis and Its…

Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that…

The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…

For an arrangement with complement X and fundamental group G, we relate the truncated cohomology ring, H^{<=2}(X), to the second nilpotent quotient, G/G_3. We define invariants of G/G_3 by counting normal subgroups of a fixed prime index p,…

Graphlets of order $k$ in a graph $G$ are connected subgraphs induced by $k$ nodes (called $k$-graphlets) or by $k$ edges (called edge $k$-graphlets). They are among the interesting subgraphs in network analysis to get insights on both the…

For $k\ge 2$ even, let $d_{k,N}$ denote the dimension of the largest simple Hecke submodule of $S_{k}(\Gamma_0(N); \mathbb{Q})^\text{new}$. We show, using a simple analytic method, that $d_{k,N} \gg_k \log\log N / \log(2p)$ with $p$ the…

For every graph $G$, let $\omega(G)$ be the largest size of complete subgraph in $G$. This paper presents a simple algorithm which, on input a graph $G$, a positive integer $k$ and a small constant $\epsilon>0$, outputs a graph $G'$ and an…

With a strong motivational background in search engine optimization the amount of structured data on the web is growing rapidly. The main search engine providers are promising great increase in visibility through annotation of the web…

We determine the A(1)-homotopy of the topological cyclic homology of the connective real K-theory spectrum ko. The answer has an associated graded that is a free F_2[v_2^4]-module of rank 52, on explicit generators in stems -1 \le * \le 30.…

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

We study finding and listing $k$-cliques in a graph, for constant $k\geq 3$, a fundamental problem of both theoretical and practical importance. Our main contribution is a new output-sensitive algorithm for listing $k$-cliques in graphs,…

The generic homomorphism problem, which asks whether an input graph $G$ admits a homomorphism into a fixed target graph $H$, has been widely studied in the literature. In this article, we provide a fine-grained complexity classification of…

The annotation of textual information is a fundamental activity in Linguistics and Computational Linguistics. This article presents various observations on annotations. It approaches the topic from several angles including Hypertext,…

Semantic annotation, the process of identifying key-phrases in texts and linking them to concepts in a knowledge base, is an important basis for semantic information retrieval and the Semantic Web uptake. Despite the emergence of semantic…

Persistent homology (PH) encodes global information, such as cycles, and is thus increasingly integrated into graph neural networks (GNNs). PH methods in GNNs typically traverse an increasing sequence of subgraphs. In this work, we first…

In this paper, we are interested in short homologically and homotopically independent loops based at the same point on Riemannian surfaces and metric graphs. First, we show that for every closed Riemannian surface of genus $g \geq 2$ and…

We consider problems about packing and counting Hamilton $\ell$-cycles in hypergraphs of large minimum degree. Given a hypergraph $\mathcal H$, for a $d$-subset $A\subseteq V(\mathcal H)$, we denote by $d_{\mathcal H}(A)$ the number of…

The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…

Unstructured text data annotation is foundational to management research. LLMs offer a cost-effective and scalable alternative to human annotation, but they introduce a novel challenge: the annotator itself can be retired. Proprietary…

Human-annotated preference data play an important role in aligning large language models (LLMs). In this paper, we study two connected questions: how to monitor the quality of human preference annotators and how to incentivize them to…

Given a simplicial complex K with weights on its simplices and a chain on it, the Optimal Homologous Chain Problem (OHCP) is to find a chain with minimal weight that is homologous (over the integers) to the given chain. The OHCP is…