Related papers: On Pivot Orbits of Boolean Functions
Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…
Understanding the role that subgradients play in various second-order variational analysis constructions can help us uncover new properties of important classes of functions in variational analysis. Focusing mainly on the behavior of the…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
Let $G$ be a connected reductive algebraic group over an algebraically closed field ${\bf k}$ of characteristic not equal to 2, let $\B$ be the variety of all Borel subgroups of $G$, and let $K$ be a symmetric subgroup of $G$. Fixing a…
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…
Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…
For a continuous map on a topological graph containing a loop $S$ it is possible to define the degree (with respect to the loop $S$) and, for a map of degree $1$, rotation numbers. We study the rotation set of these maps and the periods of…
In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…
We prove that a bounded linear Hilbert space operator has the unit circle in its essential approximate point spectrum if and only if it admits an orbit satisfying certain orthogonality and almost-orthogonality relations. This result is…
In this paper we study a subclass of subcartesian space-the orbit space of a proper action of Lie group on smooth manifold. We show that continuous functions on orbit space can be approximated by smooth functions.
Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…
The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity…
The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of…
We define a Poisson Algebra called the {\em swapping algebra} using the intersection of curves in the disk. We interpret a subalgebra of the fraction algebra of the swapping algebra -- called the {\em algebra of multifractions} -- as an…
Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…
We develop a framework for dealing with smooth approximations to billiards with corners in the two-dimensional setting. Let a polygonal trajectory in a billiard start and end up at the same billiard's corner point. We prove that smooth…
We provide lower bounds on the gonality of a graph in terms of its spectral and edge expansion. As a consequence, we see that the gonality of a random 3-regular graph is asymptotically almost surely greater than one seventh its genus.
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…
We introduce the framework of path-complete graph Lyapunov functions for approximation of the joint spectral radius. The approach is based on the analysis of the underlying switched system via inequalities imposed among multiple Lyapunov…
This paper studies various aspects of inverse limits of locally expanding affine linear maps on flat branched manifolds, which I call flat Wieler solenoids. Among the aspects studied are different types of cohomologies, the rates of mixing…