Related papers: Pair-Trace Absorption Certificates for Regular Ind…
In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G…
By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…
Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…
We discuss a simple example of an F-theory compactification on a Calabi-Yau fourfold where background fluxes, together with nonperturbative effects from Euclidean D3 instantons and gauge dynamics on D7 branes, allow us to fix all closed and…
We study the problem of finding unitary submatrices of the $N \times N$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of…
Let ${\cal F}$ be a family of graphs. In the ${\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph…
We study lossy compression of a finite statement source generated in a fixed deductive environment. The source symbols are statements in a knowledge base endowed with a shared proof system, and reconstruction fidelity is measured by…
The QED renormalization is restudied by using a mass-dependent subtraction which is performed at a time-like renormalization point. The subtraction exactly respects necessary physical and mathematical requirements such as the gauge…
Let $X$ be a quasi projective scheme over a noetherian affine scheme $Spec(A)$, $U\subseteq X$ be an open subset, and $Z=X-U$.Assume that $Z$ is complete intersection, with $k=codim Z$. Consider the map $$ q:{\mathbb K}\left({\mathscr…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
The structure positive of unitary irreducible representations of the noncompact $u_q(2,1)$ quantum algebra that are related to a positive discrete series is examined. With the aid of projection operators for the $su_q(2)$ subalgebra, a…
For a finite collection of graphs ${\cal F}$, the \textsc{${\cal F}$-TM-Deletion} problem has as input an $n$-vertex graph $G$ and an integer $k$ and asks whether there exists a set $S \subseteq V(G)$ with $|S| \leq k$ such that $G…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…
A new approach of graph matching is introduced in this paper, which efficiently solves the problem of graph isomorphism and subgraph isomorphism. In this paper we are introducing a new approach called SubGraD, for query graph detection in…
An induced subgraph is called an induced matching if each vertex is a degree-1 vertex in the subgraph. The \textsc{Almost Induced Matching} problem asks whether we can delete at most $k$ vertices from the input graph such that the remaining…
We consider the graphs whose edges are marked by the integers (weights) from $0$ to $q-1$ (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked in such a way that the weight of every edge is equal to the…
Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach…
Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as…