Search results for "combinatoric"
showing 10 items of 1776 documents
Unicity of biproportion
1994
International audience; The biproportion of S on margins of M is called the intern composition law, K: (S,M) -> X = K(S,M) / X = A S B. A and B are diagonal matrices, algorithmically computed, providing the respect of margins of M. Biproportion is an empirical concept. In this paper, the author shows that any algorithm used to compute a biproportion leads to the me result. Then the concept is unique and no longer empirical. Some special properties are also indicated.
Galois groups and genetic code
2021
This article was inspired by the inverse problem of Galois theory. Galois groups are realized as number theoretic symmetry groups realized physically in TGD a symmetries of space-time surfaces. Galois confinement as an analog of color confinement is proposed in TGD inspired quantum biology . Galois groups, in particular simple Galois groups, play a fundamental role in the TGD view of cognition. The TGD based model of the genetic code involves in an essential manner the groups A5 (icosahedron), which is the smallest non-abelian simple group, and A4 (tetrahedron). The identification of these groups as Galois groups leads to a more precise view about genetic code. The question why the genetic …
On shortening u-cycles and u-words for permutations
2017
Abstract This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature to the recent relevant studies for the de Bruijn sequences. A particular result we obtain in this paper is that u-words for n -permutations exist of lengths n ! + ( 1 − k ) ( n − 1 ) for k = 0 , 1 , … , ( n − 2 ) ! .
Gray coding cubic planar maps
2016
International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.
Words with the Maximum Number of Abelian Squares
2015
An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain \(\varTheta (n^2)\) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.
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…