# James Currie

## Contact Details

NameJames Currie |
||

Affiliation |
||

Location |
||

## Pubs By Year |
||

## Pub CategoriesMathematics - Combinatorics (20) High Energy Physics - Phenomenology (10) Computer Science - Discrete Mathematics (3) High Energy Physics - Experiment (1) Mathematics - Dynamical Systems (1) |

## Publications Authored By James Currie

We study the single jet inclusive cross section up to next-to-next-to leading order in perturbative QCD, implemented in the parton-level event generator NNLOJET . Our results are fully differential in the jet transverse momentum and rapidity and we apply fiducial cuts for comparison with the available ATLAS 7 TeV 4.5 fb$^{-1}$ data for jet radius $R=0. Read More

While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we characterize the unavoidable formulas with reversal that have at most two one-way variables ($x$ is a one-way variable in formula with reversal $\phi$ if exactly one of $x$ and $x^R$ appears in $\phi$). Read More

Hadronic jets in deeply inelastic electron-proton collisions are produced by the scattering of a parton from the proton with the virtual gauge boson mediating the interaction. The HERA experiments have performed precision measurements of inclusive single jet production and di-jet production in the Breit frame, which provide important constraints on the strong coupling constant and on parton distributions in the proton. We describe the calculation of the next-to-next-to-leading order (NNLO) QCD corrections to these processes, and assess their size and impact. Read More

We present an infinite family of formulas with reversal whose avoidability index is bounded between 4 and 5, and we show that several members of the family have avoidability index 5. This family is particularly interesting due to its size and the simple structure of its members. For each $k\in\{4,5\}$, there are several previously known avoidable formulas (without reversal) of avoidability index $k$, but they are small in number and they all have rather complex structure. Read More

We report the first calculation of fully differential jet production in all partonic channels at next-to-next-to leading order (NNLO) in perturbative QCD and compare to the available ATLAS 7 TeV data. We discuss the size and shape of the perturbative corrections along with their associated scale variation across a wide range in jet transverse momentum, $p_{T}$, and rapidity, $y$. We find significant effects, especially at low $p_{T}$, and discuss the possible implications for Parton Distribution Function fits. Read More

The production of two-jet final states in deep inelastic scattering is an important QCD precision observable. We compute it for the first time to next-to-next-to-leading order (NNLO) in perturbative QCD. Our calculation is fully differential in the lepton and jet variables and allows one to impose cuts on the jets both in the laboratory and the Breit frame. Read More

We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern $xyzxzyx$. In fact, we: (1) characterize all the (two-way) infinite ternary square-free words avoiding letter pattern $xyzxzyx$ (2) characterize the lexicographically least (one-way) infinite ternary square-free word avoiding letter pattern $xyzxzyx$ (3) show that the number of ternary square-free words of length $n$ avoiding letter pattern $xyzxzyx$ grows exponentially with $n$. Read More

Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. Read More

In previous work, Currie and Rampersad showed that the growth of the number of binary words avoiding the pattern xxx^R was intermediate between polynomial and exponential. We now show that the same holds for the growth of the number of binary words avoiding the pattern xx^Rx. Curiously, the analysis for xx^Rx is much simpler than that for xxx^R. Read More

For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable. Read More

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the existence of upper and lower bounds on the number of such words of length $n$, where each of these bounds is asymptotically equivalent to a (different) function of the form $Cn^{\lg n+c}$, where $C$, $c$ are constants. Read More

We report on the calculation of the next-to-next-to-leading order (NNLO) QCD corrections to the production of two gluonic jets at hadron colliders. In previous work, we discussed gluonic dijet production in the gluon-gluon channel. Here, for the first time, we update our numerical results to include the leading colour contribution to the production of two gluonic jets via quark-antiquark scattering. Read More

In this talk we present the calculation of next-to-next-to-leading order (NNLO) QCD corrections to dijet production and related observables at hadron colliders in the purely gluonic channel. Results for this channel are obtained keeping all orders of $N_C$ in the colour expansion. We show that the NNLO correction significantly reduces the scale uncertainty compared to next-to-leading order (NLO). Read More

In this talk I discuss the application and generalization of the antenna subtraction method to processes involving incoherent interferences of partial amplitudes, which are generically present for the sub-leading colour contributions to processes involving more than five partons. The approach makes use of the known infrared (IR) singularity structure of one- and two-loop matrix elements to guide the construction of the subtraction terms. A set of integrated dipoles are defined which can be used to express the poles of one- and two-loop matrix elements in terms of integrated antennae. Read More

We present the next-to-next-to-leading order (NNLO) QCD corrections to dijet production in the purely gluonic channel retaining the full dependence on the number of colours. The sub-leading colour contribution in this channel first appears at NNLO and, as expected, increases the NNLO correction by around 10% and exhibits a pT dependence, rising from 8% at low pT to 15% at high pT . The present calculation demonstrates the utility of the antenna subtraction method for computing the full colour NNLO corrections to dijet production at the Large Hadron Collider. Read More

Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the shift map. Let S be a finite alphabet that is in bijective correspondence via a mapping c with the set of nonempty suffixes of the images f(a) for a in A. Read More

Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X. In this paper we consider the extremal words of morphic words. If X = g(f^{\omega}(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal words are morphic. Read More

We consider the infrared structure of hadron-hadron collisions at next-to-next-to leading order using the antenna subtraction method. The general form of the subtraction terms is presented for double real, real-virtual and double virtual contributions. At NLO and NNLO it is shown that the virtual and double virtual subtraction terms can be written in terms of integrated dipoles, formed by systematically combining the mass factorisation contributions and integrated antenna functions. Read More

We answer a question of Harju: An infinite square-free ternary word with an $n$-stem factorization exists for any $n\ge 13$. We show that there are uniform ternary morphisms of length $k$ for every $k\ge 23$. This resolves almost completely a problem of the author and Rampersad. Read More

In this talk I discuss the antenna subtraction method for isolating infrared (IR) singularities of jet cross sections in perturbative QCD. The method is applied at next-to-next-to-leading order (NNLO) to dijet production in hadron collisions at the LHC. The double real radiative corrections to the dijet cross section are considered and their IR behaviour is examined. Read More

We show that there exists an infinite word over the alphabet {0, 1, 3, 4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from 1994. Read More

We show that the problem of whether the fixed point of a morphism avoids Abelian $k$-powers is decidable under rather general conditions Read More

We give the avoidance indices (morphic and antimorphic) for all unary patterns with involution. Read More

We prove the non-existence of recurrent words with constant Abelian complexity containing 4 or more distinct letters. This answers a question of Richomme et al. Read More

We give an effective characterization of the lexicographically least word in the orbit closure of the Rudin-Shapiro word w having a specified prefix. In particular, the lexicographically least word in the orbit closure of the Rudin-Shapiro word is 0w. This answers a question Allouche et al. Read More

**Category:**Mathematics - Combinatorics

We prove Dejean's conjecture. Specifically, we show that Dejean's conjecture holds for the last remaining open values of n, namely 15 <= n <= 26. Read More

We show that Dejean's conjecture holds for n>=27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible. Read More

A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. Read More

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n. Read More

We extend Carpi's results by showing that Dejean's conjecture holds for n >= 30. Read More

Richomme asked the following question: what is the infimum of the real numbers $\alpha$ > 2 such that there exists an infinite word that avoids $\alpha$-powers but contains arbitrarily large squares beginning at every position? We resolve this question in the case of a binary alphabet by showing that the answer is $\alpha$ = 7/3. Read More

For each $\alpha > 2$ there is a binary word with critical exponent $\alpha$. Read More

We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps. Read More