184 research outputs found
Generalized bent Boolean functions and strongly regular Cayley graphs
In this paper we define the (edge-weighted) Cayley graph associated to a
generalized Boolean function, introduce a notion of strong regularity and give
several of its properties. We show some connections between this concept and
generalized bent functions (gbent), that is, functions with flat Walsh-Hadamard
spectrum. In particular, we find a complete characterization of quartic gbent
functions in terms of the strong regularity of their associated Cayley graph.Comment: 13 pages, 2 figure
Partitioning Perfect Graphs into Stars
The partition of graphs into "nice" subgraphs is a central algorithmic
problem with strong ties to matching theory. We study the partitioning of
undirected graphs into same-size stars, a problem known to be NP-complete even
for the case of stars on three vertices. We perform a thorough computational
complexity study of the problem on subclasses of perfect graphs and identify
several polynomial-time solvable cases, for example, on interval graphs and
bipartite permutation graphs, and also NP-complete cases, for example, on grid
graphs and chordal graphs.Comment: Manuscript accepted to Journal of Graph Theor
The Spectrum of an Adelic Markov Operator
With the help of the representation of SL(2,Z) on the rank two free module
over the integer adeles, we define the transition operator of a Markov chain.
The real component of its spectrum exhibits a gap, whereas the non-real
component forms a circle of radius 1/\sqrt{2}.Comment: 38 pages, 5 figure
Sum of squares lower bounds for refuting any CSP
Let be a nontrivial -ary predicate. Consider a
random instance of the constraint satisfaction problem on
variables with constraints, each being applied to randomly
chosen literals. Provided the constraint density satisfies , such
an instance is unsatisfiable with high probability. The \emph{refutation}
problem is to efficiently find a proof of unsatisfiability.
We show that whenever the predicate supports a -\emph{wise uniform}
probability distribution on its satisfying assignments, the sum of squares
(SOS) algorithm of degree
(which runs in time ) \emph{cannot} refute a random instance of
. In particular, the polynomial-time SOS algorithm requires
constraints to refute random instances of
CSP when supports a -wise uniform distribution on its satisfying
assignments. Together with recent work of Lee et al. [LRS15], our result also
implies that \emph{any} polynomial-size semidefinite programming relaxation for
refutation requires at least constraints.
Our results (which also extend with no change to CSPs over larger alphabets)
subsume all previously known lower bounds for semialgebraic refutation of
random CSPs. For every constraint predicate~, they give a three-way hardness
tradeoff between the density of constraints, the SOS degree (hence running
time), and the strength of the refutation. By recent algorithmic results of
Allen et al. [AOW15] and Raghavendra et al. [RRS16], this full three-way
tradeoff is \emph{tight}, up to lower-order factors.Comment: 39 pages, 1 figur
- âŠ