Search results for "combinatoric"
showing 10 items of 1776 documents
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…
A quasiconformal composition problem for the Q-spaces
2017
Given a quasiconformal mapping $f:\mathbb R^n\to\mathbb R^n$ with $n\ge2$, we show that (un-)boundedness of the composition operator ${\bf C}_f$ on the spaces $Q_{\alpha}(\mathbb R^n)$ depends on the index $\alpha$ and the degeneracy set of the Jacobian $J_f$. We establish sharp results in terms of the index $\alpha$ and the local/global self-similar Minkowski dimension of the degeneracy set of $J_f$. This gives a solution to [Problem 8.4, 3] and also reveals a completely new phenomenon, which is totally different from the known results for Sobolev, BMO, Triebel-Lizorkin and Besov spaces. Consequently, Tukia-V\"ais\"al\"a's quasiconformal extension $f:\mathbb R^n\to\mathbb R^n$ of an arbitr…
Structure of eigenvectors of random regular digraphs
2018
Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this paper, we study the structure of the kernel of submatrices of $M-z\,{\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and gradual with many levels. As a corollary, we show, in particular, that every eigenvector of $M$, except for constant multiples of $(1,1,\dots,1)$, possesses a weak delocalization property: its level sets have cardin…
Homogeneous actions on the random graph
2018
We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite group, admit such an action and we extend our results to groups acting on trees. Finally, we show the ubiquity of finitely generated free dense subgroups of the automorphism group of the Random Graph whose action on it have all orbits infinite.
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
2010
AbstractWe report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).
Periodic Classification of Local Anaesthetics (Procaine Analogues)
2006
Algorithms for classification are proposed based on criteria (information entropyand its production). The feasibility of replacing a given anaesthetic by similar ones in thecomposition of a complex drug is studied. Some local anaesthetics currently in use areclassified using characteristic chemical properties of different portions of their molecules.Many classification algorithms are based on information entropy. When applying theseprocedures to sets of moderate size, an excessive number of results appear compatible withdata, and this number suffers a combinatorial explosion. However, after the equipartitionconjecture, one has a selection criterion between different variants resulting fromc…