Minimum-error discrimination among three pure linearly independent symmetric qutrit states

2012 ◽  
Vol 12 (2) ◽  
pp. 1255-1260 ◽  
Author(s):  
Y. Mazhari Khiavi ◽  
Y. Akbari Kourbolagh
2015 ◽  
Vol 52 (3) ◽  
pp. 350-370
Author(s):  
Jaroslav Hančl ◽  
Katarína Korčeková ◽  
Lukáš Novotný

We introduce the two new concepts, productly linearly independent sequences and productly irrational sequences. Then we prove a criterion for which certain infinite sequences of rational numbers are productly linearly independent. As a consequence we obtain a criterion for the irrationality of infinite products and a criterion for a sequence to be productly irrational.


Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4865-4873 ◽  
Author(s):  
Milos Petrovic

Generalized m-parabolic K?hler manifolds are defined and holomorphically projective mappings between such manifolds have been considered. Two non-linear systems of PDE?s in covariant derivatives of the first and second kind for the existence of such mappings are given. Also, relations between five linearly independent curvature tensors of generalized m-parabolic K?hler manifolds with respect to these mappings are examined.


1994 ◽  
Vol 1 (5) ◽  
pp. 459-467
Author(s):  
T. Buchukuri ◽  
D. Yanakidi

Abstract We investigate the solutions of boundary value problems of linear electroelasticity, having growth as a power function in the neighbourhood of infinity or in the neighbourhood of an isolated singular point. The number of linearly independent solutions of this type is established for homogeneous boundary value problems.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Adisorn Kittisopaporn ◽  
Pattrawut Chansangiam

AbstractThis paper proposes an effective gradient-descent iterative algorithm for solving a generalized Sylvester-transpose equation with rectangular matrix coefficients. The algorithm is applicable for the equation and its interesting special cases when the associated matrix has full column-rank. The main idea of the algorithm is to have a minimum error at each iteration. The algorithm produces a sequence of approximated solutions converging to either the unique solution, or the unique least-squares solution when the problem has no solution. The convergence analysis points out that the algorithm converges fast for a small condition number of the associated matrix. Numerical examples demonstrate the efficiency and effectiveness of the algorithm compared to renowned and recent iterative methods.


2020 ◽  
Vol 2020 (8) ◽  
Author(s):  
Gui-Jun Ding ◽  
Stephen F. King ◽  
Cai-Chang Li ◽  
Ye-Ling Zhou

Abstract We consider for the first time level 7 modular invariant flavour models where the lepton mixing originates from the breaking of modular symmetry and couplings responsible for lepton masses are modular forms. The latter are decomposed into irreducible multiplets of the finite modular group Γ7, which is isomorphic to PSL(2, Z7), the projective special linear group of two dimensional matrices over the finite Galois field of seven elements, containing 168 elements, sometimes written as PSL2(7) or Σ(168). At weight 2, there are 26 linearly independent modular forms, organised into a triplet, a septet and two octets of Γ7. A full list of modular forms up to weight 8 are provided. Assuming the absence of flavons, the simplest modular-invariant models based on Γ7 are constructed, in which neutrinos gain masses via either the Weinberg operator or the type-I seesaw mechanism, and their predictions compared to experiment.


Sign in / Sign up

Export Citation Format

Share Document