EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 301 – 320 of 363

Expansion in finite simple groups of Lie type

Emmanuel Breuillard, Ben J. Green, Robert Guralnick, Terence Tao (2015)

Journal of the European Mathematical Society

We show that random Cayley graphs of finite simple (or semisimple) groups of Lie type of fixed rank are expanders. The proofs are based on the Bourgain-Gamburd method and on the main result of our companion paper [BGGT].

Expansion in $S L_{d} (𝒪_{K} / I)$ , $I$ square-free

Péter P. Varjú (2012)

Journal of the European Mathematical Society

Let $S$ be a fixed symmetric finite subset of $S L_{d} (𝒪_{K})$ that generates a Zariski dense subgroup of $S L_{d} (𝒪_{K})$ when we consider it as an algebraic group over $m a t h b b Q$ by restriction of scalars. We prove that the Cayley graphs of $S L_{d} (𝒪_{K} / I)$ with respect to the projections of $S$ is an expander family if $I$ ranges over square-free ideals of $𝒪_{K}$ if $d = 2$ and $K$ is an arbitrary numberfield, or if $d = 3$ and $K = ℚ$ .

Expected lengths of minimum spanning trees for non-identical edge distributions.

Li, Wenbo V., Zhang, Xinyi (2010)

Electronic Journal of Probability [electronic only]

Experimental comparison of 2-satisfiability algorithms

Rossella Petreschi, Bruno Simeone (1991)

RAIRO - Operations Research - Recherche Opérationnelle

Experimental comparison of graph drawing algorithms for cubic graphs.

Calamoneri, Tiziana, Jannelli, Simone, Petreschi, Rossella (1999)

Journal of Graph Algorithms and Applications

Experiments with the fixed-parameter approach for two-layer planarization.

Suderman, Matthew, Whitesides, Sue (2005)

Journal of Graph Algorithms and Applications

Explicit Cayley covers of Kautz digraphs.

Brunat, Josep M. (2011)

The Electronic Journal of Combinatorics [electronic only]

Explicit enumeration of triangulations with multiple boundaries.

Krikun, Maxim (2007)

The Electronic Journal of Combinatorics [electronic only]

Explicit formulas for Bernoulli and Euler numbers.

Vella, David C. (2008)

Integers

Explicit inverse of the Pascal matrix plus one.

Yang, Sheng-Liang, Liu, Zhong-Kui (2006)

International Journal of Mathematics and Mathematical Sciences

Explicit plethystic formulas for Macdonald $(q, t)$ -Kostka coefficients.

Garsia, Adriano, Haiman, Mark, Tesler, Glenn (1999)

Séminaire Lotharingien de Combinatoire [electronic only]

Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.

Le Anh Vinh (2008)

The Electronic Journal of Combinatorics [electronic only]

Explicit Ramsey graphs and orthonormal labelings.

Alon, Noga (1994)

The Electronic Journal of Combinatorics [electronic only]

Exploiting the structure of conflict graphs in high level synthesis

Klaus Jansen (1994)

Commentationes Mathematicae Universitatis Carolinae

In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.

Exploring the $q$ -Riemann zeta function and $q$ -Bernoulli polynomials.

Kim, T., Ryoo, C.S., Jang, L.C., Rim, S.H. (2005)

Discrete Dynamics in Nature and Society

Exponential generating function of hyperharmonic numbers indexed by arithmetic progressions

István Mező (2013)

Open Mathematics

There is a circle of problems concerning the exponential generating function of harmonic numbers. The main results come from Cvijovic, Dattoli, Gosper and Srivastava. In this paper, we extend some of them. Namely, we give the exponential generating function of hyperharmonic numbers indexed by arithmetic progressions; in the sum several combinatorial numbers (like Stirling and Bell numbers) and the hypergeometric function appear.

Currently displaying 301 – 320 of 363

Previous Page 16 Next

Displaying 301 – 320 of 363

Expansion in finite simple groups of Lie type

Expansion in $S L_{d} (𝒪_{K} / I)$ , $I$ square-free

Expected lengths of minimum spanning trees for non-identical edge distributions.

Experimental comparison of 2-satisfiability algorithms

Experimental comparison of graph drawing algorithms for cubic graphs.

Experiments with the fixed-parameter approach for two-layer planarization.

Explicit Cayley covers of Kautz digraphs.

Explicit enumeration of triangulations with multiple boundaries.

Explicit formulas for Bernoulli and Euler numbers.

Explicit inverse of the Pascal matrix plus one.

Explicit plethystic formulas for Macdonald $(q, t)$ -Kostka coefficients.

Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces.

Explicit Ramsey graphs and orthonormal labelings.

Exploiting the structure of conflict graphs in high level synthesis

Exploring the $q$ -Riemann zeta function and $q$ -Bernoulli polynomials.

Exponential generating function of hyperharmonic numbers indexed by arithmetic progressions

Exponential generating functions for trees with weighted edges and labeled nodes.

Exponential Riordan arrays and permutation enumeration.

Exponential triples.

Exponents of primes in generalized binomial coefficients.

Currently displaying 301 – 320 of 363