Search results for "Computer Science::Data Structures and Algorithms"
showing 6 items of 96 documents
Scalar quark searches in $e^+ e^-$ collisions at $\sqrt{s}$ = 181-184 GeV
1998
Searches for scalar top, scalar bottom and degenerate scalar quarks have been performed with data collected with the ALEPH detector at LEP. The data sample consists of 57 pb^-1 taken at sqrt{s} = 181-184 GeV. No evidence for scalar top, scalar bottom or degenerate scalar quarks was found in the channels tilde{t} --> c chi, tilde{t} --> b l snu, tilde{b} --> b chi, and tilde{q} --> q chi. From the channel tilde{t} --> c chi a limit of 74 GeV/c^2 has been set on the scalar top quark mass, independent of the mixing angle. This limit assumes a mass difference between the stop and the chi in the range 10-40 GeV/c^2. From the channel tilde{t} --> b l snu the mixing-angle-indepen…
Search for pair production of the scalar top quark in muon+tau final states
2012
We present a search for the pair production of scalar top quarks ($\tilde{t}_{1}$), the lightest supersymmetric partners of the top quarks, in $p\bar{p}$ collisions at a center-of-mass energy of 1.96 TeV, using data corresponding to an integrated luminosity of {7.3 $fb^{-1}$} collected with the \dzero experiment at the Fermilab Tevatron Collider. Each scalar top quark is assumed to decay into a $b$ quark, a charged lepton, and a scalar neutrino ($\tilde{\nu}$). We investigate final states arising from $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\mu\tau \tilde{\nu} \tilde{\nu}$ and $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\tau\tau \tilde{\nu} \tilde{\nu}$. With no si…
Search for Pair Production of Supersymmetric Top Quarks in Dilepton Events frompp¯Collisions ats=1.96 TeV
2010
We present the results of a search for pair production of the supersymmetric partner of the top quark (the top squark (t) over tilde (1)) decaying to a b quark and a chargino (chi) over tilde (+/-)(1) with a subsequent (chi) over tilde (+/-)(1) decay into a neutralino (chi) over tilde (0)(1), lepton l, and neutrino nu Using a data sample corresponding to 2.7 fb(-1) of integrated luminosity of p (p) over bar collisions at root s = 1: 96 TeV collected by the CDF II detector, we reconstruct the mass of top squark candidate events and fit the observed mass spectrum to a combination of standard model processes and (t) over tilde (1)(t) over tilde (1). We find no evidence for (t) over tilde (1)(t…
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
A note on Hilbert’s weak nullstellensatz
2015
In this article, through a suitable generalization of the well-known notion of spectrum of an element of an arbitrary normed algebra of Operator Theory, it will be possible to give another simple proof of the Hilbert’s Weak Nullstellensatz.
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.