Results 1  10
of
17,711
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
leader determination) for groups of discretetime agents. In each case, we introduce a linear/nonlinear consensus protocol and provide convergence analysis for the proposed distributed algorithm. Moreover, we establish a connection between the Fiedler eigenvalue of the information flow in a network (i
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 474 (7 self)
 Add to MetaCart
be constructed as the quotient (C n+1 −{0})/C ∗. In §2, we will see that there is a similar construction for any toric variety X. In this case, the algebraic group G = HomZ(An−1(X), C ∗ ) acts on an affine space C ∆(1) such that the categorical quotient (C ∆(1) − Z)/G exists and is isomorphic to X
Oligomorphic permutation groups
 LONDON MATHEMATICAL SOCIETY STUDENT TEXTS
, 1999
"... A permutation group G (acting on a set Ω, usually infinite) is said to be oligomorphic if G has only finitely many orbits on Ω n (the set of ntuples of elements of Ω). Such groups have traditionally been linked with model theory and combinatorial enumeration; more recently their grouptheoretic pro ..."
Abstract

Cited by 320 (26 self)
 Add to MetaCart
an introduction to permutation groups and to some of the more specific topics we require, and the second describes the links to model theory and enumeration. We give a spread of examples, describe results on the growth rate of the counting functions, discuss a graded algebra associated with an oligomorphic group
Renormalization in quantum field theory and the RiemannHilbert problem. II. The βfunction, diffeomorphisms and the renormalization group
 Comm. Math. Phys
"... We show that renormalization in quantum field theory is a special instance of a general mathematical procedure of multiplicative extraction of finite values based on the Riemann–Hilbert problem. Given a loop γ(z), z  = 1 of elements of a complex Lie group G the general procedure is given by evalu ..."
Abstract

Cited by 332 (39 self)
 Add to MetaCart
(where z is now the deviation from 4 of the complex dimension) of elements of the decorated Butcher group (obtained using the MilnorMoore theorem from the Kreimer Hopf algebra of renormalization) and that the above general procedure delivers the renormalized physical theory in the minimal substraction
Gravity coupled with matter and the foundation of non commutative geometry
, 1996
"... We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D i ..."
Abstract

Cited by 343 (17 self)
 Add to MetaCart
We first exhibit in the commutative case the simple algebraic relations between the algebra of functions on a manifold and its infinitesimal length element ds. Its unitary representations correspond to Riemannian metrics and Spin structure while ds is the Dirac propagator ds = ×— × = D −1 where D
Analytic Analysis of Algorithms
, 1992
"... . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial struct ..."
Abstract

Cited by 331 (13 self)
 Add to MetaCart
structures. Asymptotic methods based on complex analysis permit to extract directly coefficients of structurally complicated generating functions without a need for explicit coefficient expansions. Three major groups of problems relative to algebraic equations, differential equations, and iteration
Symplectic reflection algebras, CalogeroMoser space, and deformed HarishChandra homomorphism
 Invent. Math
"... To any finite group Γ ⊂ Sp(V) of automorphisms of a symplectic vector space V we associate a new multiparameter deformation, Hκ, of the algebra C[V]#Γ, smash product of Γ with the polynomial algebra on V. The parameter κ runs over points of CP r, where r = number of conjugacy classes of symplectic ..."
Abstract

Cited by 280 (39 self)
 Add to MetaCart
To any finite group Γ ⊂ Sp(V) of automorphisms of a symplectic vector space V we associate a new multiparameter deformation, Hκ, of the algebra C[V]#Γ, smash product of Γ with the polynomial algebra on V. The parameter κ runs over points of CP r, where r = number of conjugacy classes of symplectic
Accelerated Image Reconstruction using Ordered Subsets of Projection Data
 IEEE TRANS. MED. IMAG
, 1994
"... We define ordered subset processing for standard algorithms (such as Expectation Maximization, EM) for image restoration from projections. Ordered subsets methods group projection data into an ordered sequence of subsets (or blocks). An iteration of ordered subsets EM is defined as a single pass thr ..."
Abstract

Cited by 301 (2 self)
 Add to MetaCart
We define ordered subset processing for standard algorithms (such as Expectation Maximization, EM) for image restoration from projections. Ordered subsets methods group projection data into an ordered sequence of subsets (or blocks). An iteration of ordered subsets EM is defined as a single pass
Hecke algebras and Schur algebras of the symmetric group
, 1998
"... These notes give a fully selfcontained introduction to the (modular) representation theory of the IwahoriHecke algebras and the qSchur algebras of the symmetric groups. The central aim of this work is to give a concise, but complete, and an elegant, yet quick, treatment of the classificatio ..."
Abstract

Cited by 188 (19 self)
 Add to MetaCart
These notes give a fully selfcontained introduction to the (modular) representation theory of the IwahoriHecke algebras and the qSchur algebras of the symmetric groups. The central aim of this work is to give a concise, but complete, and an elegant, yet quick, treatment
Results 1  10
of
17,711