Related papers: A note on clique-width and tree-width for structur…

The problem of categorical data analysis in high dimensions is considered. A discussion of the fundamental difficulties of probability modeling is provided, and a solution to the derivation of high dimensional probability distributions…

A proof is sketched of the Polynomial Conjecture of the author (circulated as preprint "Brick Tiling and Monotone Boolean Functions", available at the http://www.math.ufl.edu/~squash/tilingstuff.html url) which says that the family of…

In an attempt to find a polynomial-time algorithm for the edge-clique cover problem on cographs we tried to prove that the edge-clique graphs of cographs have bounded rankwidth. However, this is not the case. In this note we show that the…

Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

Here we study the unitary groups that can be constructed using elements from the qubit Clifford Hierarchy. We first provide a necessary and sufficient canonical form that semi-Clifford and generalized semi-Clifford elements must satisfy to…

We present a uniform theory of constructible sheaves on arbitrary schemes with coefficients in topological or even condensed rings. This is accomplished by defining lisse sheaves to be the dualizable objects in the derived infinity-category…

We define a notion of coordinatization for $\aleph_0$-categorical structures which is, like Lie coordinatized structures in [2], a certain kind of expansion of a tree. We show that a structure which is coordinatized, in a certain strong…

Let Q_n be the graph of n times n times n cube with all non-decreasing diagonals (including the facial ones) in its constituent unit cubes. Suppose that a subset S of V(Q_n) separates the left side of the cube from the right side. We show…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

We propose a generalization of small world networks, in which the reconnection of links is governed by a function that depends on the distance between the elements to be linked. An adequate choice of this function lets us control the…

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary…

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Let $G$ be an undirected graph. We say that $G$ contains a ladder of length $k$ if the $2 \times (k+1)$ grid graph is an induced subgraph of $G$ that is only connected to the rest of $G$ via its four cornerpoints. We prove that if all the…

We study random $k$-connected chordal graphs with bounded tree-width. Our main results are scaling limits and quenched local limits.

In this paper the notion of Dirac structure in finite dimension is extended to the convenient setting. In particular, we introduce the notion of partial Dirac structure on convenient Lie algebroids and manifolds. We then look for those…

We show that there exists a family of instances of the lot-sizing problem, such that any branch-and-bound tree that solves them requires an exponential number of nodes, even in the case when the branchings are performed on general split…

A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…