相关论文: On Pivot Orbits of Boolean Functions
We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…
We describe, in a very explicit way, a method for determining the spectra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regular or not).
Recent research in graph pebbling has introduced the notion of a cover pebbling number. Along this same idea, we develop a more general pebbling function Pi(G, t, P). This measures the minimum number of pebbles needed to guarantee that any…
We establish lower bounds on the dimensions in which arithmetic groups with torsion can act on acyclic manifolds and homology spheres. The bounds rely on the existence of elementary p-groups in the groups concerned. In some cases, including…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…
The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
We introduce the Plaque Topology on the inverse limit of a branched covering self-map of a Riemann surface of a finite degree greater than one. We present the notions of regular and irregular points in the setting of this Plaque Inverse…
We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…
The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…
A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…
Spectrum of a certain class of first order conformally invariant operators on the sphere is explicitly computed. The class contains the (elliptic verions of) Rarita-Schwinger operator and its higher spin analogues.
We extend the modular orbits method of constructing a two-dimensional orbifold conformal field theory to higher genus Riemann surfaces. We find that partition functions on surfaces of arbitrary genus can be constructed by a straightforward…
Connected branches of periodic orbits originating at a Hopf bifurcation point of a differential system are considered. A computable estimate for the range of amplitudes of periodic orbits contained in the branch is provided under the…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically cheap functions that are…
Orbit recovery is a central problem in both mathematics and applied sciences, with important applications to structural biology. This paper focuses on recovering generic orbits of functions on ${\mathbb R}^{n}$ and the sphere $S^{n-1}$…