English
Related papers

Related papers: On Modal {\mu}-Calculus over Finite Graphs with Bo…

200 papers

A class of infinite dimensional Galilean conformal algebra in (2+1) dimensional spacetime is studied. Each member of the class, denoted by \alg_{\ell}, is labelled by the parameter \ell. The parameter \ell takes a spin value, i.e., 1/2, 1,…

Mathematical Physics · Physics 2014-08-15 N. Aizawa , Y. Kimura

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

Combinatorics · Mathematics 2025-08-14 Rachel Galindo , Jessica McDonald , Songling Shan

We provide a finite forbidden induced subgraph characterization for the graph class $\varUpsilon_k$, for all $k \in \mathbb{N}_0$, which is defined as follows. A graph is in $\varUpsilon_k$ if for any induced subgraph, $\Delta \leq \chi -1…

Discrete Mathematics · Computer Science 2016-09-14 Oliver Schaudt , Vera Weil

We extend the homotopy theories based on point reduction for finite spaces and simplicial complexes to finite acyclic categories and $\Delta$-complexes, respectively. The functors of classifying spaces and face posets are compatible with…

Algebraic Topology · Mathematics 2017-07-06 Kohei Tanaka

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

Logic in Computer Science · Computer Science 2023-03-03 Pierre Ohlmann , Michał Pilipczul , Szymon Toruńczyk , Wojciech Przybyszewski

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…

Combinatorics · Mathematics 2022-12-19 Alireza Mofidi

We explore the conjectured duality between a class of large $N$ matrix integrals, known as multicritical matrix integrals (MMI), and the series $(2m-1,2)$ of non-unitary minimal models on a fluctuating background. We match the critical…

High Energy Physics - Theory · Physics 2021-07-07 Dionysios Anninos , Beatrix Mühlmann

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

For $k \ge 1$ we consider the $K$-algebra $H(k) := H(C,kD,\Omega)$ associated to a symmetrizable Cartan matrix $C$, a symmetrizer $D$, and an orientation $\Omega$ of $C$, which was defined in Part 1. We construct and analyse a reduction…

Representation Theory · Mathematics 2018-05-17 Christof Geiss , Bernard Leclerc , Jan Schröer

In submodular $k$-partition, the input is a non-negative submodular function $f$ defined over a finite ground set $V$ (given by an evaluation oracle) along with a positive integer $k$ and the goal is to find a partition of the ground set…

Data Structures and Algorithms · Computer Science 2023-07-11 Karthekeyan Chandrasekaran , Weihang Wang

There is a long-standing belief that the modular tensor categories $\mathcal{C}(\mathfrak{g},k)$, for $k\in\mathbb{Z}_{\geq1}$ and finite-dimensional simple complex Lie algebras $\mathfrak{g}$, contain exceptional connected \'etale algebras…

Quantum Algebra · Mathematics 2018-10-23 Andrew Schopieray

One deals with r-regular bipartite graphs with 2n vertices. In a previous paper Butera, Pernici, and the author have introduced a quantity d(i), a function of the number of i-matchings, and conjectured that as n goes to infinity the…

Combinatorics · Mathematics 2019-09-10 Paul Federbush

We introduce a notion of matrix valued Gram decompositions for correlation matrices whose study is motivated by quantum information theory. We show that for extremal correlations, the matrices in such a factorization generate a Clifford…

Optimization and Control · Mathematics 2018-10-01 Anupam Prakash , Antonios Varvitsiotis

For any positive integer $k$, let $\mathcal{G}_k$ denote the set of finite groups $G$ such that all Cayley graphs ${\rm Cay}(G,S)$ are integral whenever $|S|\le k$. Est${\rm \acute{e}}$lyi and Kov${\rm \acute{a}}$cs \cite{EK14} classified…

Group Theory · Mathematics 2015-06-18 Xuanlong Ma , Kaishun Wang

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

Logic in Computer Science · Computer Science 2015-03-31 Sandra Kiefer , Pascal Schweitzer , Erkal Selman

Let $G$ be a finite solvable group with disconnected character degree graph $\Delta(G)$. Under these conditions, it follows from a result of P\'alfy that $\Delta(G)$ consists of two connected components. Another result of P\'alfy's gives an…

Combinatorics · Mathematics 2025-04-03 Mark L. Lewis , Andrew Summers

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

Logic · Mathematics 2020-01-27 Trevor M. Wilson

We classify 1-tilting classes over an arbitrary commutative ring. As a consequence, we classify all resolving subcategories of finitely presented modules of projective dimension at most 1. Both these collections are in 1-1 correspondence…

Commutative Algebra · Mathematics 2016-06-06 Michal Hrbek

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Combinatorics · Mathematics 2026-05-25 Connor Phillips