English
Related papers

Related papers: New linear invariants of hypergraphs

200 papers

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…

Combinatorics · Mathematics 2020-03-09 Bernard Mans , Min Sha , Jeffrey Smith , Daniel Sutantyo

Let $k,a,b$ be positive integers with $a+b=k$. A $k$-uniform hypergraph is called an $(a,b)$-cycle if there is a partition $(A_0,B_0,A_1,B_1,\ldots,A_{t-1},B_{t-1})$ of the vertex set with $|A_i|=a$, $|B_i|=b$ such that $A_i\cup B_i$ and…

Combinatorics · Mathematics 2022-08-19 Jian Wang

Let ${\mathcal B}(H)$ denote the Banach algebra of all bounded linear operators on a complex Hilbert space $H$ with $\dim H\geq 3$, and let $\mathcal A$ and $\mathcal B$ be subsets of ${\mathcal B}(H)$ which contain all rank one operators.…

Functional Analysis · Mathematics 2017-05-01 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

We establish new lower bounds for the Tur\'an and Zarankiewicz numbers of certain apex partite hypergraphs. Given a $(d-1)$-partite $(d-1)$-uniform hypergraph $\mathcal{H}$, let $\mathcal{H}(k)$ be the $d$-partite $d$-uniform hypergraph…

Combinatorics · Mathematics 2025-10-10 Qiyuan Chen , Hong Liu , Ke Ye

A graph $G=(V,E)$ is called $(k,\ell)$-full if $G$ contains a subgraph $H=(V,F)$ of $k|V|-\ell$ edges such that, for any non-empty $F' \subseteq F$, $|F'| \leq k|V(F')| - \ell$ holds. Here, $V(F')$ denotes the set of vertices incident to…

Data Structures and Algorithms · Computer Science 2011-03-15 Hiro Ito , Shin-ichi Tanigawa , Yuichi Yoshida

Both the Klein-Williams invariant $\ell_G(f)$ from \cite{KW2} and the generalized equivariant Lefschetz invariant $\lambda_G(f)$ from \cite{weber07} serve as complete obstructions to the fixed point problem in the equivariant setting. The…

Algebraic Topology · Mathematics 2025-05-29 Başak Küçük

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

Combinatorics · Mathematics 2025-11-14 Qiming Fang , Sihong Shao

In the present paper, for a given (possibly, infinite) strongly connected digraph $\cal{D},$ we consider the class $\cal{S}_{<}({\cal D})$ of all truthly substochastic weightings of ${\cal D}$ (here, the word "truthly" means that there…

Combinatorics · Mathematics 2023-11-23 S. V. Savchenko

We define and study a family of link invariants $\mathit{HFK}_{n}(L)$. Although these homology theories are defined using holomorphic disc counts, they share many properties with $sl_{n}$ homology. Using these theories, we give a framework…

Geometric Topology · Mathematics 2018-04-11 Nathan Dowlin

The $\mathbb{Z}_{2}$-equivariant Heegaard Floer cohomlogy $\widehat{HF}_{\mathbb{Z}_{2}}(\Sigma(K))$ of a knot $K$ in $S^{3}$, constructed by Hendricks, Lipshitz, and Sarkar, is an isotopy invariant which is defined using bridge diagrams of…

Geometric Topology · Mathematics 2018-10-05 Sungkyung Kang

The number of homomorphisms from a finite graph $F$ to the complete graph $K_n$ is the evaluation of the chromatic polynomial of $F$ at $n$. Suitably scaled, this is the Tutte polynomial evaluation $T(F;1-n,0)$ and an invariant of the cycle…

Combinatorics · Mathematics 2016-02-25 Andrew Goodall , Guus Regts , Lluis Vena

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

Combinatorics · Mathematics 2017-03-09 Luke Sernau

We study the tt*-geometry with vanishing endormorphism $\mathcal{U}$. Given an integrable harmonic Higgs bundle $(E, h, \Phi, \mathcal{U},\mathcal{Q})$ on a complex manifold $M$, Firstly we prove that, under the \emph{IS} condition,…

Differential Geometry · Mathematics 2022-09-20 Jiezhu Lin , Xuanming Ye

A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at…

Combinatorics · Mathematics 2016-05-16 Samuel Hetterich , Olaf Parczyk , Yury Person

The properties of a hypergraph explored through the spectrum of its unified matrix was made by the authors in [26]. In this paper, we introduce three different hypergraph matrices: unified Laplacian matrix, unified signless Laplacian…

Combinatorics · Mathematics 2024-11-14 R. Vishnupriya , R. Rajkumar

For an $r$-uniform hypergraph $H$, let $\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\tau^{(m)}(H)$ denote the minimum size of a collection…

Combinatorics · Mathematics 2022-10-25 Abdul Basit , Daniel McGinnis , Henry Simmons , Matt Sinnwell , Shira Zerbib

We give explicit formulas for torus-equivariant fundamental classes of closed $K$-orbits on the flag variety $G/B$ when $G$ is one of the classical groups $SL(n,\C)$, $SO(n,\C)$, or $Sp(2n,\C)$, and $K$ is a symmetric subgroup of $G$. We…

Algebraic Geometry · Mathematics 2016-11-26 Benjamin J. Wyser

In 1968, Ringel and Youngs confirmed the last open case of the Heawood Conjecture by determining the genus of every complete graph $K_n$. In this paper, we investigate the minimum genus embeddings of the complete $3$-uniform hypergraphs…

Combinatorics · Mathematics 2020-04-08 Yifan Jing , Bojan Mohar

The goal of this work is to give precise bounds on the counting complexity of a family of generalized coloring problems (list homomorphisms) on bounded-treewidth graphs. Given graphs $G$, $H$, and lists $L(v)\subseteq V(H)$ for every $v\in…

Computational Complexity · Computer Science 2021-11-01 Jacob Focke , Dániel Marx , Paweł Rzążewski

Gukov-Pei-Putrov-Vafa constructed $q$-series invariants called homological blocks in a physical way in order to categorify Witten-Reshetikhin-Turaev (WRT) invariants and conjectured that radial limits of homological blocks are WRT…

Geometric Topology · Mathematics 2022-05-10 Akihito Mori , Yuya Murakami
‹ Prev 1 8 9 10 Next ›