Related papers: On Pivot Orbits of Boolean Functions
We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…
The Reeb space of a smooth function is a topological and combinatoric object and fundamental and important in understanding topological and geometric properties of the manifold of the domain. It is the graph and a topological space endowed…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
Let $M^{(u)}$, $H^{(u)}$ be the maximal operator and Hilbert transform along the parabola $(t, ut^2) $. For $U\subset(0,\infty)$ we consider $L^p$ estimates for the maximal functions $\sup_{u\in U}|M^{(u)} f|$ and $\sup_{u\in U}|H^{(u)}…
We define and study a class of codes obtained from scrolls over curves of any genus over finite fields. These codes generalize Goppa codes in a natural way, and the orthogonal complements of these codes belong to the same class. We show how…
Boolean functions are mathematical objects with numerous applications in domains like coding theory, cryptography, and telecommunications. Finding Boolean functions with specific properties is a complex combinatorial optimization problem…
We establish shape holomorphy results for general weakly- and hyper-singular boundary integral operators arising from second-order partial differential equations in unbounded two-dimensional domains with multiple finite-length open arcs.…
We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…
We propose to study deformation quantizations of Whitney functions. To this end, we extend the notion of a deformation quantization to algebras of Whitney functions over a singular set, and show the existence of a deformation quantization…
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…
We report a method for constructing bandpass functions that approximate a given analytic function with arbitrary accuracy over a finite interval. A corollary is that bandpass functions can be obtained that oscillate arbitrarily slower than…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be…
We study isospectrality on p-forms of compact flat manifolds by using the equivariant spectrum of the Hodge-Laplacian on the torus. We give an explicit formula for the multiplicity of eigenvalues and a criterion for isospectrality. We…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
We present an orthogonal basis for functions over a slice of the Boolean hypercube. Our basis is also an orthogonal basis of eigenvectors for the Johnson and Kneser graphs. As an application of our basis, we streamline Wimmer's proof of…