Search results for "Computer Science::Discrete Mathematics"
showing 10 items of 55 documents
Open and Closed Prefixes of Sturmian Words
2013
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.
Strong chromatic index of products of graphs
2007
Graphs and Algorithms
"Table 44" of "Search for long-lived particles produced in $pp$ collisions at $\sqrt{s}=13$ TeV that decay into displaced hadronic jets in the ATLAS …
2018
Endcap MS vertex efficiencies (in %) for baryogenesis $\chi \rightarrow \tau\tau\nu$ benchmark samples ($m_{h}=125$ GeV). The vertex reconstruction efficiency is defined as the fraction of simulated LLP decays in the MS fiducial volume that match a reconstructed vertex ($\Delta R(\textrm{LLP,vertex}) = 0.4$) passing the baseline event selection and satisfying the vertex isolation criteria. A vertex is considered matched to a displaced decay if the vertex is within $\Delta R = 0.4$ of the simulated decay position. The MS vertex efficiency is parameterized as a function of the LLP decay position.
An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph
2001
International audience; In this article we characterize bipartite graphs whose associated neighborhood hypergraphs have the Helly property. We examine incidence graphs both hypergraphs and linear hypergraphs and we give a polynomial algorithm to recognize if a linear hypergraph has the Helly property.
"Table 4" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Number of tracks in vertex vs invariant mass of vertex (DATA) The number of tracks in the vertex vs the invariant mass of the vertex, for the data, and for the MH signal sample respectively. All selection cuts are applied, with the exceptions of those on the variables in the plot (Ntrk and mass), and the offline muon requirements.
"Table 5" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Number of tracks in vertex vs invariant mass of vertex (SIGNAL) The number of tracks in the vertex vs the invariant mass of the vertex, for the data, and for the MH signal sample respectively. All selection cuts are applied, with the exceptions of those on the variables in the plot (Ntrk and mass), and the offline muon requirements.
"Table 1" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Efficiency-vs-radial-vertex-position without re-tracking The efficiency for reconstructing a displaced vertex passing all cuts, as a function of radial distance from the z-axis to the vertex positon. The retrack and noretrack suffixes refer to whether or not the procedure known as re-tracking, where the tracking algorithm is re-run with looser cuts, on the leftover hits from standard tracking, was used to select the tracks that were input to the vertexing algorithm.
"Table 2" of "Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton-proton collisions at sqrt…
2012
Efficiency-vs-radial-vertex-position with re-tracking The efficiency for reconstructing a displaced vertex passing all cuts, as a function of radial distance from the z-axis to the vertex positon. The retrack and noretrack suffixes refer to whether or not the procedure known as re-tracking, where the tracking algorithm is re-run with looser cuts, on the leftover hits from standard tracking, was used to select the tracks that were input to the vertexing algorithm.
The Reconstruction of Polyominoes from Approximately Orthogonal Projections
2001
The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NP-complete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3).
"Table 1" of "$\Lambda$ polarization in associated K$^+$ - $\Lambda$ electro-production"
2000
LAMBDA polarization, with respect to the p_gamma x p_k axis.