On the Orchard crossing number of complete bipartite graphs
We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.
math.CO↗
arXiv subjects
David Garber
Publications and source records attributed to David Garber.
Eulerian partitions for configurations of skew lines
In this paper, which is a complement of \cite{BG}, we study a few elementary invariants for configurations of skew lines, as introduced and analyzed first by Viro and his collaborators. We slightly simplify the exposition of some known invariants and use them to define a natural partition of the lines in a skew configuration. We also describe an algorithm which constructs a spindle-permutation for a given switching class, or proves non-existence of such a spindle-permutation.
math.CO↗
Conjugation-free geometric presentations of fundamental groups of arrangements
We introduce the notion of a conjugation-free geometric presentation for a fundamental group of a line arrangement's complement, and we show that the fundamental groups of the following family of arrangements have a conjugation-free geometric presentation: A real arrangement L, whose graph of multiple points is a union of disjoint cycles, has no line with more than two multiple points, and where the multiplicities of the multiple points are arbitrary. We also compute the exact group structure (by means of a semi-direct product of groups) of the arrangement of 6 lines whose graph consists of a cycle of length 3, and all the multiple points have multiplicity 3.
math.GT↗
The Orchard crossing number of an abstract graph
We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number. Moreover, we define a variant of this crossing number which is tightly connected to the rectilinear crossing number, and compute it for some simple families of graphs.
math.CO↗
Braid Group Cryptography
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryptosystems based on the braid group, and some of the known attacks on these cryptosystems. We conclude with a discussion of future directions (which includes also a description of cryptosystems which are based on other non-commutative groups).
cs.CR↗
On the excedance sets of colored permutations
We define the excedence set and the excedance word on $G_{r,n}$, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.
math.CO↗
Recursions for Excedance number in some permutations groups
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups G_r,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity result concerning a variant of the excedance number. Finally, we show that the generating function of the excedance number defined on G_r,n is symmetric.
math.CO↗
Counting descent pairs with prescribed colors in the colored permutation groups
We define new statistics, (c, d)-descents, on the colored permutation groups Z_r \wr S_n and compute the distribution of these statistics on the elements in these groups. We use some combinatorial approaches, recurrences, and generating functions manipulations to obtain our results.
math.CO↗
Towards the computation of the convex hull of a configuration from its corresponding separating matrix
In this paper, we cope with the following problem: compute the size of the convex hull of a configuration C, where the given data is the number of separating lines between any two points of the configuration (where the lines are generated by pairs of other points of the configuration). We give an algorithm for the case that the convex hull is of size 3, and a partial algorithm and some directions for the case that the convex hull is of size bigger than 3.
math.CO↗
On the fundamental group of the complement of two tangent conics and an arbitrary number of tangent lines
We compute the fundamental groups of the complements of the family of real conic-line arrangements with up to two conics which are tangent to each other at two points, with an arbitrary number of tangent lines to both conics. All the resulting groups turn out to be big.
math.GT↗
Statistics on the multi-colored permutation groups
We define an excedance number for the multi-colored permutation group, i.e. the wreath product of Z_{r_1} x ... x Z_{r_k} with S_n, and calculate its multi-distribution with some natural parameters. We also compute the multi-distribution of the parameters exc(pi) and fix(pi) over the sets of involutions in the multi-colored permutation group. Using this, we count the number of involutions in this group having a fixed number of excedances and absolute fixed points.
math.CO↗
Excedance number for involutions in complex reflection groups
We define the excedance number on the complex reflection groups and compute its multidistribution with the number of fixed points on the set of involutions in these groups. We use some recurrence formulas and generating functions manipulations to obtain our results.
math.CO↗
Fundamental groups of Tangent Conic-Line arrangements with Singularities up to order 6
We list all the possible fundamental groups of the complements of real conic-line arrangements with two conics which are tangent to each other at two points, with up to two additional lines. For the computations we use the topological local braid monodromies and the techniques of Moishezon-Teicher and van-Kampen. We also include some conjectures concerning the connection between the presentation of the fundamental group of the complements and the geometry of an interesting family of conic line arrangements.
math.GT↗
Spindle configurations of skew lines
We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations. We also slightly simplify the exposition of some known invariants for configurations of skew lines and use them to define a natural partition of the lines in a skew configuration. Finally, we describe an algorithm which constructs a spindle in a given switching class, or proves non-existence of such a spindle.
math.GT↗
On the excedance number of colored permutation groups
We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of $S_n$ with some natural parameters to the colored permutation group and to the Coxeter group of type $D$. We define two different orders on these groups which induce two different excedance numbers. Surprisingly, in the case of the colored permutation group, we get the same generalized formulas for both orders.
math.CO↗
Local braid monodromies and local fundamental groups of tangented conic-line arrangements
This paper is the first part of a series of three papers about the fundamental groups of conic-line arrangements consist of two tangented conics and up to two additional tangented lines. In this part, we compute the local braid monodromies and the local fundamental groups of the singularities which appear in such arrangements.
math.GT↗
Plane curves and their fundamental groups: Generalizations of Uludag's construction
In this paper we investigate Uludag's method for constructing new curves whose fundamental groups are central extensions of the fundamental group of the original curve by finite cyclic groups. In the first part, we give some generalizations to his method in order to get new families of curves with controlled fundamental groups. In the second part, we discuss some properties of groups which are preserved by these methods. Afterwards, we describe precisely the families of curves which can be obtained by applying the generalized methods to several types of plane curves. We also give an application of the general methods for constructing new Zariski pairs.
math.GT↗
On the connection between affine and projective fundamental groups of line arrangements and curves
In this note we prove a decomposition related to the affine fundamental group and the projective fundamental group of a line arrangement and a reducible curve with a line component. We give some applications to this result.
math.GT↗