Search results for "Combinatorics"
showing 10 items of 1770 documents
Measurement ofD0−D¯0mixing using the ratio of lifetimes for the decaysD0→K−π+andK+K−
2009
We present a measurement of ${D}^{0}\mathrm{\text{\ensuremath{-}}}{\overline{D}}^{0}$ mixing and $CP$ violation using the ratio of lifetimes simultaneously extracted from a sample of ${D}^{0}$ mesons produced through the flavor-tagged process ${D}^{*+}\ensuremath{\rightarrow}{D}^{0}{\ensuremath{\pi}}^{+}$, where ${D}^{0}$ decays to ${K}^{\ensuremath{\mp}}{\ensuremath{\pi}}^{\ifmmode\pm\else\textpm\fi{}}$, ${K}^{\ensuremath{-}}{K}^{+}$, or ${\ensuremath{\pi}}^{\ensuremath{-}}{\ensuremath{\pi}}^{+}$, along with the untagged decays ${D}^{0}\ensuremath{\rightarrow}{K}^{\ensuremath{\mp}}{\ensuremath{\pi}}^{\ifmmode\pm\else\textpm\fi{}}$ and ${D}^{0}\ensuremath{\rightarrow}{K}^{\ensuremath{-}}{K}…
Correcting for Potential Barriers in Quantum Walk Search
2015
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with $N$. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the $\Theta(\sqrt{N})$ runtime.
Two-step nilpotent Leibniz algebras
2022
In this paper we give a complete classification of two-step nilpotent Leibniz algebras in terms of Kronecker modules associated with pairs of bilinear forms. In particular, we describe the complex and the real case of the indecomposable Heisenberg Leibniz algebras as a generalization of the classical $(2n+1)-$dimensional Heisenberg Lie algebra $\mathfrak{h}_{2n+1}$. Then we use the Leibniz algebras - Lie local racks correspondence proposed by S. Covez to show that nilpotent real Leibniz algebras have always a global integration. As an application, we integrate the indecomposable nilpotent real Leibniz algebras with one-dimensional commutator ideal. We also show that every Lie quandle integr…
On the condition number of the antireflective transform
2010
Abstract Deconvolution problems with a finite observation window require appropriate models of the unknown signal in order to guarantee uniqueness of the solution. For this purpose it has recently been suggested to impose some kind of antireflectivity of the signal. With this constraint, the deconvolution problem can be solved with an appropriate modification of the fast sine transform, provided that the convolution kernel is symmetric. The corresponding transformation is called the antireflective transform. In this work we determine the condition number of the antireflective transform to first order, and use this to show that the so-called reblurring variant of Tikhonov regularization for …
Explicit solutions for second-order operator differential equations with two boundary-value conditions. II
1992
AbstractBoundary-value problems for second-order operator differential equations with two boundary-value conditions are studied for the case where the companion operator is similar to a block-diagonal operator. This case is strictly more general than the one treated in an earlier paper, and it provides explicit closed-form solutions of boundary-value problem in terms of data without increasing the dimension of the problem.
Separation properties of (n, m)-IFS attractors
2017
Abstract The separation properties of self similar sets are discussed in this article. An open set condition for the (n, m)- iterated function system is introduced and the concepts of self similarity, similarity dimension and Hausdorff dimension of the attractor generated by an (n, m) - iterated function system are studied. It is proved that the similarity dimension and the Hausdorff dimension of the attractor of an (n, m) - iterated function system are equal under this open set condition. Further a necessary and sufficient condition for a set to satisfy the open set condition is established.
Acute Type Refinements of Tetrahedral Partitions of Polyhedral Domains
2001
We present a new technique to perform refinements on acute type tetrahedral partitions of a polyhedral domain, provided that the center of the circumscribed sphere around each tetrahedron belongs to the tetrahedron. The resulting family of partitions is of acute type; thus, all the tetrahedra satisfy the maximum angle condition. Both these properties are highly desirable in finite element analysis.
Matrices A such that A^{s+1}R = RA* with R^k = I
2018
[EN] We study matrices A is an element of C-n x n such that A(s+1)R = RA* where R-k = I-n, and s, k are nonnegative integers with k >= 2; such matrices are called {R, s+1, k, *}-potent matrices. The s = 0 case corresponds to matrices such that A = RA* R-1 with R-k = I-n, and is studied using spectral properties of the matrix R. For s >= 1, various characterizations of the class of {R, s + 1, k, *}-potent matrices and relationships between these matrices and other classes of matrices are presented. (C) 2018 Elsevier Inc. All rights reserved.
The generic local structure of time-optimal synthesis with a target of codimension one in dimension greater than two
1997
In previous papers, we gave in dimension 2 and 3 a classification of generic synthesis of analytic systems\(\dot v(t) = X(v(t)) + u(t)Y(v(t))\) with a terminal submanifoldN of codimension one when the trajectories are not tangent toN. We complete here this classification in all generic cases in dimension 3, giving a topological classification and a model in each case. We prove also that in dimensionn≥3, out of a subvariety ofN of codimension there, we have described all the local synthesis.
Semipredictable dynamical systems
2015
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We prove a general result: The dynamics of any deterministic nonlinear cellular automaton (CA) with $p$ possible dynamical states can be decomposed at each instant of time in a superposition of $N$ layers involving $p_{0}$, $p_{1}$,... $p_{N-1}$ dynamical states each, where the $p_{k\in \mathbb{N}}$, $k \in [0, N-1]$ are divisors of $p$. If the divisors coincide with the prime factors of $p$ this decomposition is unique. Conversely, we also prove that $N$ CA w…