Related papers: Bruhat graphs and pattern avoidance
We characterise, in terms of Dixmier-Ohno invariants, the types of singularities that a plane quartic curve can have. We then use these results to obtain new criteria for determining the stable reduction types of non-hyperelliptic curves of…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…
The traditional study of plane and space algebraic curves by looking at their tangent vectors, curvatures and torsions provides geometric, but unfortunately not sufficient information about individual curves in order to be able to…
We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…
We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show…
Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In this thesis, we introduced and carried out a combinatorial study of permutations that avoid one or two patterns of length 3 according to the statistic number of crossings. For this purpose, we manipulated a bijection of Elizalde and Pak…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
We provide a bijection between a class of 3-dimensional pattern avoiding permutations and triangle bases, special sets of integer points arising from the theory of tilings and TEP subshifts. This answers a conjecture of Bonichon and Morel.
Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…
It is well known that the Gauss map for a complex plane curve is birational, whereas the Gauss map in positive characteristic is not always birational. Let $q$ be a power of a prime integer. We study a certain plane curve of degree…
We study singularities of Gauss maps of fronts and give characterizations of types of singularities of Gauss maps by geometric properties of fronts which are related to behavior of bounded principal curvatures. Moreover, we investigate…
This is a survey paper. We study the Ricci curvature and spectrum of graphs, as well as the exterior forms and deRahm cohomology on graphs.