Related papers: Induced subgraphs of powers of oriented cycles

We introduce a notion of the \emph{crux} of a graph $G$, measuring the order of a smallest dense subgraph in $G$. This simple-looking notion leads to some generalisations of known results about cycles, offering an interesting paradigm of…

In applications, quantities of interest are often modelled in equilibrium or an equilibrium solution is sought. The presence of confounding makes causal inference in this setting challenging. We provide interpretable graphical models for…

We propose an improved algorithm for counting the number of Hamiltonian cycles in a directed graph. The basic idea of the method is sequential acceptance/rejection, which is successfully used in approximating the number of perfect matchings…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

We propose a novel definition of hypergraphical matroids, defined for arbitrary hypergraphs, simultaneously generalizing previous definitions for regular hypergraphs (Main, 1978), and for the hypergraphs of circuits of a matroid…

Two $q$-analogs of the hypercube graph are introduced and shown to be related through a graph quotient. The roles of the subspace lattice graph, of a twisted primitive elements of $U_q(\mathfrak{su}(2))$ and of the dual $q$-Krawtchouk…

We study the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. It follows from the theorems of Dirac and of Koml\'os, Sark\"ozy, and Szemer\'edi…

We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…

We associate a deformation of Heisenberg algebra to the suitably normalized Yang $R$-matrix and we investigate its properties. Moreover, we construct new examples of quantum vertex algebras which possess the same representation theory as…

Recent advances in the integration of deep learning with automated theorem proving have centered around the representation of logical formulae as inputs to deep learning systems. In particular, there has been a growing interest in adapting…

We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general…

We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$-vertex oriented cycle will appear strictly before a directed Hamilton cycle does, except of course for the directed cycle itself.…

In terms of several summation and transformation formulas for basic hypergeometric series, two forms of the Chinese remainder theorem for coprime polynomials, the creative microscoping method introduced by Guo and Zudilin, Guo and Li's…

We unveil in concrete terms the general machinery of the syzygy-based algorithms for the implicitization of rational surfaces in terms of the monomials in the polynomials defining the parametrization, following and expanding our joint…

We show how the Hamiltonian lattice loop representation can be cast straightforwardly in the path integral formalism. The procedure is general for any gauge theory. Here we present in detail the simplest case: pure compact QED. We also…

The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of…

The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku…

This paper establishes a real integral representation of the reciprocal $\Gamma$ function in terms of a regularized hypersingular integral. The equivalence with the usual complex representation is demonstrated. A regularized complex…

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…