Related papers: Statistics on Linear Chord Diagrams

We study the problem of finding the shortest path with increasing chords in a simple polygon. A path has increasing chords if and only if for any points a, b, c, and d that lie on the path in that order, |ad| >= |bc|. In this paper we show…

We introduce a novel representation of structured polynomial ideals, which we refer to as chordal networks. The sparsity structure of a polynomial system is often described by a graph that captures the interactions among the variables.…

Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph $G$. The nodes of the reduced clique graph are the maximal cliques of $G$, and two nodes are joined by an edge if and only if they form a non-disjoint…

The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the…

The hull of a linear code $C$ is the intersection of $C$ with its dual code. We present and analyze the number of linear $q$-ary codes of the same length and dimension but with different dimensions for their hulls. We prove that for given…

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater…

In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms…

A generic immersion of a circle into a $2$-sphere is often studied as a projection of a knot; it is called a knot projection. A chord diagram is a configuration of paired points on a circle; traditionally, the two points of each pair are…

We introduce the notion of logarithmically concave (or log-concave) sequences in Coding Theory. A sequence $a_0, a_1, \dots, a_n$ of real numbers is called log-concave if $a_i^2 \ge a_{i-1}a_{i+1}$ for all $1 \le i \le n-1$. A natural…

Let $P(n,m)$ be a graph chosen uniformly at random from the class of all planar graphs on vertex set $\{1, \ldots, n\}$ with $m=m(n)$ edges. We study the cycle and block structure of $P(n,m)$ when $m\sim n/2$. More precisely, we determine…

In various stereological problems an $n$-dimensional convex body is intersected with an $(n-1)$-dimensional Isotropic Uniformly Random (IUR) hyperplane. In this paper the cumulative distribution function associated with the…

In this paper we discuss the number of regions in a unit circle after drawing $n$ i.i.d. random chords in the circle according to a particular family of distribution. We find that as $n$ goes to infinity, the distribution of the number of…

A graph is unichord free if it does not contain a cycle with exactly one chord as its subgraph. In [3], it is shown that a graph is unichord free if and only if every minimal vertex separator is a stable set. In this paper, we first show…

An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue)…

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…

Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…

String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the…

Chord diagrams are used by guitar players to show where and how to play a chord on the fretboard. They are useful to beginners learning chords or for sharing the hand positions required to play a song.However, the diagrams presented on…

We present analytical results for the distribution of the number of cycles in directed and undirected random 2-regular graphs (2-RRGs) consisting of $N$ nodes. In directed 2-RRGs each node has one inbound link and one outbound link, while…

Consider two random strings having the same length and generated by an iid sequence taking its values uniformly in a fixed finite alphabet. Artificially place a long constant block into one of the strings, where a constant block is a…