Related papers: Towards a General Direct Product Testing Theorem
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness,…
A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…
A proper $[k]$-total coloring $c$ of a graph $G$ is a mapping $c$ from $V(G)\bigcup E(G)$ to $[k]=\{1,2,\cdots,k\}$ such that $c(x)\neq c(y)$ for which $x$, $y\in V(G)\bigcup E(G)$ and $x$ is adjacent to or incident with $y$. Let $\prod(v)$…
Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,...,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect but…
For an arbitrary operator A on a Banach space X which is a generator of C_0-group with certain growth condition at the infinity, the direct theorems on connection between the smoothness degree of a vector $x\in X$ with respect to the…
The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…
We consider the following fundamental realization problem of directed graphs. Given a sequence $S:={a_1 \choose b_1},\dots,{a_n \choose b_n}$ with $a_i,b_i\in \mathbb{Z}_0^+.$ Does there exist a digraph (no loops and no parallel arcs are…
We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden…
Color refinement is an important technique that works very well in practice for the graph isomorphism problem. Tinhofer graphs are the class of graphs for which refinement together with individualization correctly tests graph isomorphism…
The three standard products (the Cartesian, the direct and the strong product) of undirected graphs have been wellinvestigated, unique prime factor decomposition (PFD) are known and polynomial time algorithms have been established for…
In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
Motivated by cryptographic applications such as predicate encryption, we consider the problem of representing an arbitrary predicate as the inner product predicate on two vectors. Concretely, fix a Boolean function $P$ and some modulus $q$.…
A graph $G$ is well-covered if all maximal independent sets of $G$ have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the…
In $k$-Digraph Coloring we are given a digraph and are asked to partition its vertices into at most $k$ sets, so that each set induces a DAG. This well-known problem is NP-hard, as it generalizes (undirected) $k$-Coloring, but becomes…
The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
We study automated test generation for verifying discrete decision-making modules in autonomous systems. We utilize linear temporal logic to encode the requirements on the system under test in the system specification and the behavior that…
Given an undirected graph $G$ and an integer $k$, the Secluded $\Pi$-Subgraph problem asks you to find a maximum size induced subgraph that satisfies a property $\Pi$ and has at most $k$ neighbors in the rest of the graph. This problem has…
Let $X_0, X_1, ..., X_k$ with $k \in \IN\cup\{\infty\}$ be sequence spaces $($finite or infinite dimensional$)$ over $\IC$ or $\IR$ with absolute norms $N_i$ for $i = 0, ..., k$, $($i.e., with 1-unconditional bases$)$ such that $\dim X_0 =…