Results 1  10
of
13
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
calculus of higherorder functions (the Icalculus and combinatory algebra), the transmission of processes as values, and the representation of data structures as processes. The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence
Structure of the peak Hopf algebra of quasisymmetric functions
, 2002
"... Abstract. We analyze the structure of Stembridge’s peak algebra, showing it to be a free commutative algebra (specifically a shuffle algebra) over Q, a cofree graded coalgebra, and a free module over Schur’s Qfunction algebra. Our analysis builds on combinatorial properties of a new monomiallik ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We analyze the structure of Stembridge’s peak algebra, showing it to be a free commutative algebra (specifically a shuffle algebra) over Q, a cofree graded coalgebra, and a free module over Schur’s Qfunction algebra. Our analysis builds on combinatorial properties of a new monomial
Renormalization, Hopf algebras and Mellin transforms
 CONTEMPORARY MATHEMATICS
, 2014
"... This article aims to give a short introduction into Hopfalgebraic aspects of renormalization, enjoying growing attention for more than a decade by now. As most available literature is concerned with the minimal subtraction scheme, we like to point out properties of the kinematic subtraction scheme ..."
Abstract
 Add to MetaCart
[x] being a morphism of Hopf algebras to the polynomials in one indeterminate. Upon introduction of analytic regularization this results in efficient combinatorial recursions to calculate φR in terms of the Mellin transform. We find that different Feynman rules are related by a distinguished class of Hopf
Monomials, binomials and RiemannRoch
 JOURNAL OF ALGEBRAIC COMBINATORICS
, 2012
"... The RiemannRoch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the Gparking functions. When G is a saturated graph, these ideals are generic and the Sc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The RiemannRoch theorem on a graph G is related to Alexander duality in combinatorial commutive algebra. We study the lattice ideal given by chip firing on G and the initial ideal whose standard monomials are the Gparking functions. When G is a saturated graph, these ideals are generic
Toward a Crlmbinatorial Proof of the Jacobian Conjecture?
"... Dominique Foata taught us how to do algebra and special functions combinatorially. Now ~ndr; Joyal and his diciples teach us how to do calculus combinatorially. The first part of this paper will describe a new approach to combinatorial calculus which was highly inspired by the Qugbec philosophy and ..."
Abstract
 Add to MetaCart
Dominique Foata taught us how to do algebra and special functions combinatorially. Now ~ndr; Joyal and his diciples teach us how to do calculus combinatorially. The first part of this paper will describe a new approach to combinatorial calculus which was highly inspired by the Qugbec philosophy
Combinatorial algorithms for distributed graph coloring
 In DISC
, 2011
"... Abstract. Numerous problems in Theoretical Computer Science can be solved very efficiently using powerful algebraic constructions. Computing shortest paths, constructing expanders, and proving the PCP Theorem, are just a few examples of this phenomenon. The quest for combinatorial algorithms that do ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
that do not use heavy algebraic machinery, but have the same (or better) efficiency has become a central field of study in this area. Combinatorial algorithms are often simpler than their algebraic counterparts. Moreover, in many cases, combinatorial algorithms and proofs provide additional understanding
Combinatorial laws for physically meaningful computational design Extended Abstract
"... A typical computer representation of a design includes geometric and physical information organized in a suitable combinatorial data structure. Queries and transformations of these design representations are used to formulate most algorithms in computational design, including analysis, optimizat ..."
Abstract
 Add to MetaCart
A typical computer representation of a design includes geometric and physical information organized in a suitable combinatorial data structure. Queries and transformations of these design representations are used to formulate most algorithms in computational design, including analysis, opti
ON RESOLUTION OF COMPACTIFICATIONS OF UNRAMIFIED PLANAR SELFMAPS
"... Abstract. The goal of this paper is to approach the twodimensional Jacobian Conjecture using ideas of birational algebraic geometry. We study the resolution of rational selfmap of the projective plane that comes from a hypothetical counterexample to the twodimensional Jacobian Conjecture and es ..."
Abstract
 Add to MetaCart
and establish several strong restrictions on its structure. In particular, we get a very detailed description of its Stein factorization. We also establish some combinatorial results on determinants of the Gram matrix of weighted trees and forests and apply them to study exceptional divisorial valuations
ORBITS OF A FIXEDPOINT SUBGROUP OF THE SYMPLECTIC GROUP ON PARTIAL FLAG VARIETIES OF TYPE A
"... Abstract. In this paper we compute the orbits of the symplectic group Sp2n on partial flag varieties GL2n/P and on partial flag varieties enhanced by a vector space, C2n ×GL2n/P. This extends analogous results proved by Matsuki on full flags. The general technique used in this paper is to take the o ..."
Abstract
 Add to MetaCart
the orbits in the full flag case and determine which orbits remain distinct when the full flag variety GL2n/B is projected down to the partial flag variety GL2n/P. The recent discovery of a connection between abstract algebra and the classical combinatorial RobinsonSchensted (RS) correspondence has sparked
Products in the category of forests and pmorphisms via Delannoy paths on Cartesian products
"... (Joint work with Ottavio M. D’Antona and Vincenzo Marra) In [5], the authors introduce a technique to compute finite coproducts of finite Gödel algebras, i.e. Heyting algebras satisfying the prelinearity axiom (α → β) ∨ (β → α). To do so, they investigate the product in the category opposite to fin ..."
Abstract
 Add to MetaCart
work we introduce a further construction of the same finite products, based on products of posets along with a generalization of the combinatorial notion of Delannoy path. The new and most interesting aspect of
Results 1  10
of
13