Related papers: Derangement Frequency in the Boolean Complex
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…
In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all…
We develop a mathematical formalism that allows to study decoherence with a great level generality, so as to make it appear as a geometrical phenomenon between reservoirs of dimensions. It enables us to give quantitative estimates of the…
Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…
Deformation theory is treated for locally notherian formal schemes (non necessarily smooth). The cotangent complex is defined in the derived category through the homology localization functor. The basic properties and results of a…
The analysis of the modifications that the presence of a deformed dispersion relation entails in the roots of the so--called degree of coherence function, for a beam embodying two different frequencies and moving in a Michelson…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
A permutation in a digraph $G=(V, E)$ is a bijection $f:V \rightarrow V$ such that for all $v \in V$ we either have that $f$ fixes $v$ or $(v, f(v)) \in E$. A derangement in $G$ is a permutation that does not fix any vertex. In [1] it is…
To a homotopy algebra one may associate its deformation complex, which is naturally a differential graded Lie algebra. We show that infinity quasi-isomorphic homotopy algebras have L-infinity quasi-isomorphic deformation complexes by an…
The topological nature of the disorder of glasses and supercooled liquids strongly affects their high-frequency dynamics. In order to understand its main features, we analytically studied a simple topologically disordered model, where the…
We study the 4-d holomorphic Spin Foam amplitude on arbitrary connected 2-complexes and degrees of divergence. With recently developed tools and truncation scheme, we derive a formula for a certain class of graphs, which allows us to write…
Degree correlation is an important topological property common to many real-world networks. In this paper, the statistical measures for characterizing the degree correlation in networks are investigated analytically. We give an exact proof…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
We describe a method for analyzing the phase space structures of Hamiltonian systems. This method is based on a time-frequency decomposition of a trajectory using wavelets. The ridges of the time-frequency landscape of a trajectory, also…
A high-frequency asymptotic scheme is generated that captures the motion of waves within discrete hexagonal and honeycomb lattices by creating continuum homogenised equations. The accuracy of these effective medium equations in describing…
Many applications, ranging from natural to social sciences, rely on graphlet analysis for the intuitive and meaningful characterization of networks employing micro-level structures as building blocks. However, it has not been thoroughly…
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a…
We study the connections between the notions of combinatorial discrepancy and graph degeneracy. In particular, we prove that the maximum discrepancy over all subgraphs $H$ of a graph $G$ of the neighborhood set system of $H$ is sandwiched…