Related papers: Twisted Sequences of Extensions
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
The effect of some properties of twisted groups on the associated algebras, particularly Cayley-Dickson and Clifford algebras. It is conjectured that the Hilbert space of square-summable sequences is a Cayley-Dickson algebra.
Infinite sequences are of tremendous theoretical and practical importance, and in the Information Age sequences of 0s and 1s are of particular interest. Over the past century, the field of symbolic dynamics has developed to study sequences…
We introduce a twisted relative trace formula which simultaneously generalizes the twisted trace formula of Langlands et.al. (in the quadratic case) and the relative trace formula of Jacquet and Lai. Certain matching statements relating…
This contribution proposes a new approach towards developing a class of probabilistic methods for classifying attributed graphs. The key concept is random attributed graph, which is defined as an attributed graph whose nodes and edges are…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
We introduce a family of rank-one local systems in the category of twisted $\mathcal{D}$-modules on a certain subvariety isomorphic to ${\mathbb{G}_{\text{m}}}^2$ of the affine flag variety of $\text{SL}_2$. We then give a criterion for…
A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding durable patterns, such as triangles and paths, which persist…
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and…
We develop two novel approaches for constructing skewed and bimodal flexible distributions that can effectively generalize classical symmetric distributions. We illustrate the application of introduced techniques by extending normal,…
The concept of structured occurrence nets is an extension of that of occurrence nets which are directed acyclic graphs that represent causality and concurrency information concerning a single execution of a distributed system. The formalism…
The topic of this paper are (multi-window) Gabor frames for signals over finite Abelian groups, generated by an arbitrary lattice within the finite time-frequency plane. Our generic approach covers simultaneously multi-dimensional signals…
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply…
We define the notion of a twisted topological graph algebra associated to a topological graph and a $1$-cocycle on its edge set. We prove a stronger version of a Vasselli's result. We expand Katsura's results to study twisted topological…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…