Related papers: On Pivot Orbits of Boolean Functions
We study a family of closed quantum graphs described by one singular vertex of order n=4. By suitable choice of the parameters specifying the singular vertex, we can construct a closed sequence of paths in the parameter space that…
We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…
This paper discusses the simplest examples of spectral zeta functions, especially those associated with graphs, a subject which has not been much studied. The analogy and the similar structure of these functions, such as their parallel…
We study the spectral aspects of the graph limit theory. We give a description of graphon convergence in terms of converegnce of eigenvalues and eigenspaces. Along these lines we prove a spectral version of the strong regularity lemma.…
The machinery of noncommutative geometry is applied to a space of connections. A noncommutative function algebra of loops closely related to holonomy loops is investigated. The space of connections is identified as a projective limit of…
This paper characterizes the attractor structure of synchronous and asynchronous Boolean networks induced by bi-threshold functions. Bi-threshold functions are generalizations of classical threshold functions and have separate threshold…
We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…
We explore how to compute, classically at strong coupling, correlation functions of local operators corresponding to classical spinning string states. The picture we obtain is of `fattened' Witten diagrams, the evaluation of which turns out…
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that…
We present a number of relations involving the number of cliques in a graph and its spectral radius.
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
We propose a mathematical model for fluids in multiphase flows in order to establish a solid theoretical foundation for the study of their complex topology, large geometric deformations, and topological changes such as merging. Our modeling…
We present a mechanism for the creation of gaps in the spectra of self-adjoint operators defined over a Hilbert space of functions on a graph, which is based on the process of graph decoration. The resulting Hamiltonians can be viewed as…
In this paper we examine the topology of inverse limit spaces generated by maps of finite graphs. In particular we explore the way in which the structure of the orbits of the turning points affects the inverse limit. We show that if $f$ has…
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…