#### Filter Results:

- Full text PDF available (57)

#### Publication Year

1994

2017

- This year (8)
- Last 5 years (23)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We prove two generalizations of the matrix-tree theorem. The first one, a result essentially due to Moon for which we provide a new proof, extends the “all minors” matrix-tree theorem to the “massive” case where no condition on row or column sums is imposed. The second generalization, which is new, extends the recently discovered Pfaffian-tree theorem of… (More)

- Abdelmalek Abdesselam, Alexander G. Belyaev, +52 authors Jeannine Wagner-Kuhr
- 2011

We present the report of the hadronic working group of the BOOST2010 workshop held at the University of Oxford in June 2010. The first part contains a review of the potential of hadronic decays of highly boosted particles as an aid for discovery at the LHC and a discussion of the status of tools developed to meet the challenge of reconstructing and… (More)

We give a rigorous nonperturbative construction of a massless discrete trajectory for Wilson’s exact renormalization group. The model is a three dimensional Euclidean field theory with a modified free propagator. The trajectory realizes the mean field to critical crossover from the ultraviolet Gaussian fixed point to an analog recently constructed by… (More)

Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical examples.

- Abdelmalek Abdesselam, Takuma Akimoto, +201 authors Rodney James Thompson
- 2006

This paper describes the silicon microstrip modules in the barrel section of the SemiConductor Tracker (SCT) of the ATLAS experiment at the CERN Large Hadron Collider (LHC). The module requirements, components and assembly techniques are given, as well as first results of the module performance on the fully-assembled barrels that make up the detector being… (More)

- Abdelmalek Abdesselam, P. J. Adkin, +162 authors E. Paganis
- 2007

The challenges for the tracking detector systems at the LHC are unprecedented in terms of the number of channels, the required readout speed and the expected radiation levels. The ATLAS Semiconductor Tracker (SCT) end-caps have a total of about 3million electronics channels each reading out every 25 ns into its own on-chip 3:3ms buffer. The highest… (More)

The hypersurfaces of degree d in the projective space P correspond to points of P , where N = ( n+d d ) − 1. Now assume d = 2e is even, and let X(n,d) ⊆ P N denote the subvariety of two e-fold hyperplanes. We exhibit an upper bound on the Castelnuovo regularity of the ideal of X(n,d), and show that this variety is r-normal for r ≥ 2. The latter result is… (More)

We prove an upper bound for the evaluation of all classical SU2 spin networks conjectured by Garoufalidis and van der Veen. This implies one half of the analogue of the volume conjecture which they proposed for classical spin networks. We are also able to obtain the other half, namely, an exact determination of the spectral radius, for the special class of… (More)

- Abdelmalek Abdesselam, JAYDEEP CHIPALKATTI A BSTRACT
- 2008

Let A,B denote generic binary forms, and let ur = (A,B)r denote their r-th transvectant in the sense of classical invariant theory. In this paper we classify all the quadratic syzygies between the {ur}. As a consequence, we show that each of the higher transvectants {ur : r ≥ 2} is redundant in the sense that it can be completely recovered from u0 and u1.… (More)

For generic binary forms A1, . . . , Ar of order d we construct a class of combinants C = {Cq : 0 ≤ q ≤ r, q 6= 1}, to be called the Wronskian combinants of the Ai. We show that the collection C gives a projective imbedding of the Grassmannian G(r, Sd), and as a corollary, any other combinant admits a formula as an iterated transvectant in the C. Our second… (More)