Search results for "Combinatorics"
showing 10 items of 1770 documents
Quadratically Tight Relations for Randomized Query Complexity
2020
In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R(f). The certificate complexity C(f) is such a complexity measure for the zero-error randomized query complexity R0(f): C(f) ≤R0(f) ≤C(f)2. In the first part of the paper we introduce a new complexity measure, expectational certificate complexity EC(f), which is also a quadratically tight bound on R0(f): EC(f) ≤R0(f) = O(EC(f)2). For R(f), we prove that EC2/3 ≤R(f). We then prove that EC(f) ≤C(f) ≤EC(f)2 and show that there is a quadratic separation between the two, thus EC(f) gives a tighter upper bound for R0(f). The measure is also related to the fractional…
Protein linear indices of the ‘macromolecular pseudograph α-carbon atom adjacency matrix’ in bioinformatics. Part 1: Prediction of protein stability …
2005
Abstract A novel approach to bio-macromolecular design from a linear algebra point of view is introduced. A protein’s total (whole protein) and local (one or more amino acid) linear indices are a new set of bio-macromolecular descriptors of relevance to protein QSAR/QSPR studies. These amino-acid level biochemical descriptors are based on the calculation of linear maps on R n [ f k ( x m i ) : R n → R n ] in canonical basis. These bio-macromolecular indices are calculated from the kth power of the macromolecular pseudograph α-carbon atom adjacency matrix. Total linear indices are linear functional on R n . That is, the kth total linear indices are linear maps from R n to the scalar R [ f k …
Multi-target QSPR assemble of a Complex Network for the distribution of chemicals to biphasic systems and biological tissues
2008
Abstract Chemometrics, that based prediction on the probability of chemical distribution to different systems, is highly important for physicochemical, environmental, and life sciences. However, the amount of information is huge and difficult to analyze. A multi-system partition Complex Network (MSP-CN) may be very useful in this sense. We define MSP-CNs as large graphs composed by nodes (chemicals) interconnected by arcs if a pair of chemicals have similar partition in a given system. Experimental quantification of partition in many systems is expensive, so we can use a Quantitative Structure–Partition Relationship (QSPR) model. Unfortunately, with classic QSPR we need to use one model for…
Random tensor theory: extending random matrix theory to random product states
2009
We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in (C^d)^{otimes k}, where k and p/d^k are fixed while d grows. When k=1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ((1+sqrt{p/d^k})^2) but the smallest eigenvalue (min(0,1-sqrt{p/d^k})^2) and the spectral density in between. We use the method of moments to show that for k>1 the largest eigenvalue is still approximately (1+sqrt{p/d^k})^2 and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix theory result to the random tensor case.…
Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
2015
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we analytically solve search on the "simplex of $K_M$ complete graphs" with all configurations of two marked vertices, two configurations of $M+1$ marked vertices, and two configurations of $2(M+1)$ marked vertices, showing that the location of the marked vertices can dramatically influence the required jumping rate of the quantum walk, such that using the wrong configuration's value can cause the search to fail. This sensitivity to the jumping rate is an is…
and the electroweak penguin contribution
2003
Abstract Our dispersive sum rule calculation of the electroweak penguin contribution to ϵ′ ϵ is reviewed. A more recent analysis based on the finite-energy sum rule approach is described. Finally, a new determination of the electroweak penguin contribution to ϵ′ ϵ is presented.
Time- and parity-violating effects of nuclear Schiff moment in molecules and solids
2020
We show that existing calculations of the interaction between nuclear Schiff moments and electrons in molecules use an inaccurate operator which gives rise to significant errors. By comparing the matrix elements of the accurate and imprecise Schiff moment operators, we calculated the correction factor as a function of the nuclear charge Z and presented corrected results for the T,P-violating interaction of the nuclear spin with the molecular axis in the TlF, RaO, PbO, TlCN, ThO, AcF molecules and in the ferroelectric solid PbTiO$_3$.
Pinched weights and duality violation in QCD sum rules: A critical analysis
2010
We analyze the so-called pinched weights, that are generally thought to reduce the violation of quarkhadron duality in finite-energy sum rules. After showing how this is not true in general, we explain how to address this question for the left-right correlator and any particular pinched weight, taking advantage of our previous work [1], where the possible high-energy behavior of the left-right spectral function was studied. In particular, we show that the use of pinched weights allows to determine with high accuracy the dimension six and eight contributions in the operator-product expansion, O-6 = (-4.3(-0.7)(+0.9)) x 10(-3) GeV6 and O-8 = (-7.2(-5.3)(+4.2)) x 10(-3) GeV8.
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
2015
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …
Modular symmetry origin of texture zeros and quark-lepton unification
2020
The even weight modular forms of level $N$ can be arranged into the common irreducible representations of the inhomogeneous finite modular group $\Gamma_N$ and the homogeneous finite modular group $\Gamma'_N$ which is the double covering of $\Gamma_N$, and the odd weight modular forms of level $N$ transform in the new representations of $\Gamma'_N$. We find that the above structure of modular forms can naturally generate texture zeros of the fermion mass matrices if we properly assign the representations and weights of the matter fields under the modular group. We perform a comprehensive analysis for the $\Gamma'_3\cong T'$ modular symmetry. The three generations of left-handed quarks are a…