618 research outputs found
Unimodality Problems in Ehrhart Theory
Ehrhart theory is the study of sequences recording the number of integer
points in non-negative integral dilates of rational polytopes. For a given
lattice polytope, this sequence is encoded in a finite vector called the
Ehrhart -vector. Ehrhart -vectors have connections to many areas of
mathematics, including commutative algebra and enumerative combinatorics. In
this survey we discuss what is known about unimodality for Ehrhart
-vectors and highlight open questions and problems.Comment: Published in Recent Trends in Combinatorics, Beveridge, A., et al.
(eds), Springer, 2016, pp 687-711, doi 10.1007/978-3-319-24298-9_27. This
version updated October 2017 to correct an error in the original versio
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
A Theory of Formal Synthesis via Inductive Learning
Formal synthesis is the process of generating a program satisfying a
high-level formal specification. In recent times, effective formal synthesis
methods have been proposed based on the use of inductive learning. We refer to
this class of methods that learn programs from examples as formal inductive
synthesis. In this paper, we present a theoretical framework for formal
inductive synthesis. We discuss how formal inductive synthesis differs from
traditional machine learning. We then describe oracle-guided inductive
synthesis (OGIS), a framework that captures a family of synthesizers that
operate by iteratively querying an oracle. An instance of OGIS that has had
much practical impact is counterexample-guided inductive synthesis (CEGIS). We
present a theoretical characterization of CEGIS for learning any program that
computes a recursive language. In particular, we analyze the relative power of
CEGIS variants where the types of counterexamples generated by the oracle
varies. We also consider the impact of bounded versus unbounded memory
available to the learning algorithm. In the special case where the universe of
candidate programs is finite, we relate the speed of convergence to the notion
of teaching dimension studied in machine learning theory. Altogether, the
results of the paper take a first step towards a theoretical foundation for the
emerging field of formal inductive synthesis
Some Implications on Amorphic Association Schemes
AMS classifications: 05E30, 05B20;
An extensive English language bibliography on graph theory and its applications, supplement 1
Graph theory and its applications - bibliography, supplement
- …