相关论文: On Pivot Orbits of Boolean Functions

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…

Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

We show that any $L^2$-bounded rational function in free semicircular random variables is a bounded operator, which implies the coincidence of the usual spectrum and $L^2$-spectrum for rational functions. Based on this observation, we also…

We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(n\log n)$ elementary flip and rotate operations can transform any rectangulation to any other…

Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…

New orthonormal basis of eigenfunctions for the Vladimirov operator of p-adic fractional derivation is constructed. The map of p-adic numbers onto real numbers (p-adic change of variables) is considered. This map (for p=2) provides an…

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…

We consider hilbert spaces of holomorphic functions in Cartan domains (in particular in ball and polydisk) and operator of restriction of holomorphic function to a submanifold in Shilov boundary. We discuss conditions when this operator…

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

Classical geometric and topological operations on polyhedra, maps and polytopes often give rise to structures with the same symmetry group as the original one, but with more flags. In this paper we introduce the notion of voltage operations…

Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…

On smooth compact manifolds with smooth boundary, we first establish the sharp lower bounds for the restrictions of harmonic functions in terms of their frequency functions, by using a combination of microlocal analysis and frequency…

Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…

In this paper, we investigate an approach to circuit lower bounds via bounded width circuits. The approach consists of two steps: (i) We convert circuits to (deterministic or nondeterministic) bounded width circuits. (ii) We prove lower…

We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is related to the number of $GF[2]$-sums (1+1=0) of…

In this paper the theory of 2-Variable Boolean Operation (2-VBO) has been discussed on a pair of n-bit strings. 2-VBO serves to bring out the relation between numbers which when plot on a 2-D surface form interesting patterns; patterns that…

We compute the equivariant fundamental class of the orbit closure of a linear series on the projective line. We also describe the boundary of the orbit closure and how the orbits specialise in one parameter families.