output
19922026
most citedThe new world atlas of artificial night sky brightness

1.7k citations

Showing 2013 · math.COShow all

7 papers · 2 filters

math.CO2013

A spectral bound for graph irregularity

Felix Goldberg

The imbalance of an edge in a graph is defined as , where is the vertex degree. The irregularity of is then defined as the sum o…

math.CO2013★ 2 cited

Normal ordering problem and the extensions of the Stirling grammar

Shi-Mei Ma, Toufik Mansour, Matthias Schork

The purpose of this paper is to investigate the connection between context-free grammars and normal ordering problem, and then to explore various extensions of the Stirling grammar…

math.CO2013

Congruence successions in compositions

Toufik Mansour, Mark Shattuck, Mark C. Wilson

A \emph{composition} is a sequence of positive integers, called \emph{parts}, having a fixed sum. By an \emph{-congruence succession}, we will mean a pair of adjacent parts …

math.CO2013

Recurrence relations for patterns of type in flattened permutations

Toufik Mansour, Mark Shattuck, David G. L. Wang

We consider the problem of counting the occurrences of patterns of the form within flattened permutations of a given length. Using symmetric functions, we find recurrence re…

math.CO2013★ 1 cited

Partial k-Parallelisms in Finite Projective Spaces

Tuvi Etzion

In this paper we consider the following question. What is the maximum number of pairwise disjoint -spreads which exist in PG(n,q)? We prove that if k+1 divides n+1 and n>k then…

math.CO2013★ 18 cited

On Multiple Pattern Avoiding Set Partitions

Vít Jelínek, Toufik Mansour, Mark Shattuck

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say th…