Two-Stage Maximum Score Estimator

This paper considers the asymptotic theory of a semiparametric M-estimator that is generally applicable to models that satisfy a monotonicity condition in one or several parametric indexes. We call the estimator two-stage maximum score (TSMS) estimator since our estimator involves a first-stage nonparametric regression when applied to the binary choice model of Manski (1975, 1985). We characterize the asymptotic distribution of the TSMS estimator, which features phase transitions depending on the dimension and thus the convergence rate of the first-stage estimation. We show that the TSMS estimator is asymptotically equivalent to the smoothed maximum-score estimator (Horowitz, 1992) when the dimension of the first-step estimation is relatively low, while still achieving partial rate acceleration relative to the cubic-root rate when the dimension is not too high. Effectively, the first-stage nonparametric estimator serves as an imperfect smoothing function on a non-smooth criterion function, leading to the pivotality of the first-stage estimation error with respect to the second-stage convergence rate and asymptotic distributio

Transition Complexity of Incomplete DFAs

In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained. It is shown that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity result is similar to that of state complexity.Comment: In Proceedings DCFS 2010, arXiv:1008.127

State Complexity of Catenation Combined with Star and Reversal

This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state complexities of their individual participating operations.Comment: In Proceedings DCFS 2010, arXiv:1008.127

State complexity of union and intersection of star on k regular languages

AbstractIn this paper, we continue our study on state complexity of combined operations. We study the state complexities of L1∗∪L2∗, ⋃i=1kLi∗, L1∗∩L2∗, and ⋂i=1kLi∗ for regular languages Li, 1≤i≤k. We obtain the exact bounds for these combined operations and show that the bounds are different from the mathematical compositions of the state complexities of their component individual operations

Next-to-leading order QCD corrections to a heavy resonance production and decay into top quark pair at the LHC

We present a complete next-to-leading order (NLO) QCD calculation to a heavy resonance production and decay into a top quark pair at the LHC, where the resonance could be either a Randall-Sundrum (RS) Kaluza-Klein (KK) graviton $G$ or an extra gauge boson $Z'$. The complete NLO QCD corrections can enhance the total cross sections by about $80\%- 100\%$ and $20\%- 40\%$ for the $G$ and the $Z'$, respectively, depending on the resonance mass. We also explore in detail the NLO corrections to the polar angle distributions of the top quark, and our results show that the shapes of the NLO distributions can be different from the leading order (LO) ones for the KK graviton. Moreover, we study the NLO corrections to the spin correlations of the top quark pair production via the above process, and find that the corrections are small.Comment: Published version in PR