Search results for "Linear"
showing 10 items of 7165 documents
Thin Bases of Order Two
2001
AbstractA set A⊆N0 is called a basis of order two if A+A≔{a+a′∣a, a′∈A}=N0. If n∈N then A(n) denotes the number of a∈A with 1⩽a⩽n. In this paper bases A, B, C of order two are given such thatlimA(n)n=253,limB(n)n=72andlimC(n)n=101653.
Compound conditionals, Fr\'echet-Hoeffding bounds, and Frank t-norms
2021
Abstract In this paper we consider compound conditionals, Frechet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying the solvability of suitable linear systems, we show under logical independence the sharpness of the Frechet-Hoeffding bounds for the prevision of conjunctions and disjunctions of n conditional events. In addition, we illustrate some details in the case of three conditional events. We study the set of all coherent prevision assessments on a family containing n conditional events and their conjunction, by verifying that it is convex. We discuss the case where the prevision of conjunctions is assessed by Lukasiewicz t-norms and we give explicit s…
Discrete Derivatives for Atom-Pairs as a Novel Graph-Theoretical Invariant for Generating New Molecular Descriptors: Orthogonality, Interpretation an…
2013
This report presents a new mathematical method based on the concept of the derivative of a molecular graph (G) with respect to a given event (S) to codify chemical structure information. The derivate over each pair of atoms in the molecule is defined as ∂G/∂S(vi , vj )=(fi -2fij +fj )/fij , where fi (or fj ) and fij are the individual frequency of atom i (or j) and the reciprocal frequency of the atoms i and j, respectively. These frequencies characterize the participation intensity of atom pairs in S. Here, the event space is composed of molecular sub-graphs which participate in the formation of the G skeleton that could be complete (representing all possible connected sub-graphs) or comp…
Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test
2017
We explore multi-round quantum memoryless communication protocols. These are restricted version of multi-round quantum communication protocols. The “memoryless” term means that players forget history from previous rounds, and their behavior is obtained only by input and message from the opposite player. The model is interesting because this allows us to get lower bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same time, we can prove stronger results with this restriction. We present a lower bound for quantum memoryless protocols. Additionally, we show a lower bound for Disjointness function for this model. As an application of communicatio…
Polynomial identities for the Jordan algebra of a degenerate symmetric bilinear form
2013
Let J(n) be the Jordan algebra of a degenerate symmetric bilinear form. In the first section we classify all possible G-gradings on J(n) where G is any group, while in the second part we restrict our attention to a degenerate symmetric bilinear form of rank n - 1, where n is the dimension of the vector space V defining J(n). We prove that in this case the algebra J(n) is PI-equivalent to the Jordan algebra of a nondegenerate bilinear form.
Convolution of three functions by means of bilinear maps and applications
1999
When dealing with spaces of vector-valued analytic functions there is a natural way to understand multipliers between them. If X and Y are Banach spaces and L(X,Y ) stands for the space of linear and continuous operators we may consider the convolution of L(X,Y )-valued analytic functions, say F (z) = ∑ n=0∞ Tnz , and X-valued polynomials, say f(z) = ∑m n=0 xnz , to get the Y -valued function F ∗ f(z) = ∑ Tn(xn)z. The second author considered such a definition and studied multipliers between H(X) and BMOA(Y ) in [5]. When the functions take values in a Banach algebra A then the natural extension of multiplier is simply that if f(z) = ∑ anz n and g(z) = ∑ bnz , then f ∗ g(z) = ∑ an.bnz n whe…
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
Nondeterministic Moore automata and Brzozowski's minimization algorithm
2012
AbstractMoore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to a given NMA. We propose an algorithm that is a variant of Brzozowski’s minimization algorithm in the sense that it is essentially structured as reverse operation and subset construction performed twice. Moreover, we explore more general classes of NMA and analyze the applicability of the algorithm. For some of such classes the algorith…
Standard Sturmian words and automata minimization algorithms
2015
The study of some close connections between the combinatorial properties of words and the performance of the automata minimization process constitutes the main focus of this paper. These relationships have been, in fact, the basis of the study of the tightness and the extremal cases of Hopcroft's algorithm, that is, up to now, the most efficient minimization method for deterministic finite state automata. Recently, increasing attention has been paid to another minimization method that, unlike the approach proposed by Hopcroft, is not based on refinement of the set of states of the automaton, but on automata operations such as determinization and reverse, and is also applicable to non-determ…
Group Input Machine
2009
We introduce a new type of internal memory for finite automata and real-time automata. Instead of using tapes with a prescribed Euclidean structure (one-dimensional or two-dimensional tapes) we allow arbitrary group structure of the internal memory of the automata.