Search results for "Combinatorics"

Complexity of decision trees for boolean functions

2004

For every positive integer k we present an example of a Boolean function f/sub k/ of n = (/sub k//sup 2k/) + 2k variables, an optimal deterministic tree T/sub k/' for f/sub k/ of complexity 2k + 1 as well as a nondeterministic decision tree T/sub k/ computing f/sub k/. with complexity k + 2; thus of complexity about 1/2 of the optimal deterministic decision tree. Certain leaves of T/sub k/ are called priority leaves. For every input a /spl isin/ {0, 1}/sup n/ if any of the parallel computation reaches a priority leaves then its label is f/sub k/ (a). If the priority leaves are not reached at all then the label on any of the remaining leaves reached by the computation is f/sub k/. (a).

On partial CAP-subgroups of finite groups

2015

Abstract Given a chief factor H / K of a finite group G, we say that a subgroup A of G avoids H / K if H ∩ A = K ∩ A ; if H A = K A , then we say that A covers H / K . If A either covers or avoids the chief factors of some given chief series of G, we say that A is a partial CAP-subgroup of G. Assume that G has a Sylow p-subgroup of order exceeding p k . If every subgroup of order p k , where k ≥ 1 , and every subgroup of order 4 (when p k = 2 and the Sylow 2-subgroups are non-abelian) are partial CAP-subgroups of G, then G is p-soluble of p-length at most 1.

A note on lower bounds of norms of averaging operators

2000

For any natural number n we obtain some examples of continuous onto maps $\phi : S\,\,\longrightarrow\, \,T$ for which Ditor's set $\Delta _\phi ^2(2, 2)$ is empty but every averaging operator for $\phi $ has norm greater or equal to 2n + 1.

Packing dimension, intersection measures, and isometries

1997

A NOTE ON THE ASYMPTOTIC PROBABILITIES OF EXISTENTIAL SECOND-ORDER MINIMAL GÖDEL SENTENCES WITH EQUALITY

1995

The minimal Gödel class is the class of first-order prenex sentences whose quantifier prefix consists of two universal quantifiers followed by just one existential quantifier. We prove that asymptotic probabilities of existential second-order sentences, whose first-order part is in the minimal Gödel class, form a dense subset of the unit interval.

Zur Hyperebenenalgebraisierung in desargues-Schen projektiven Verbandsgeometrien

1991

As a completion and extension of a result of A. Day and D. Pickering [5] we obtain the following structure theorem in the conceptual frame of projective lattice geometries: In a Desarguesian projective geometry the subgeometry of every at least one-dimensional hyperplane is module induced.

Degree sequences of digraphs with highly irregular property

1998

Quantum Queries on Permutations with a Promise

2009

This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …

Enlarging the gap between quantum and classical query complexity of multifunctions

2013

Quantum computing aims to use quantum mechanical effects for the efficient performance of computational tasks. A popular research direction is enlarging the gap between classical and quantum algorithm complexity of the same computational problem. We present new results in quantum query algorithm design for multivalued functions that allow to achieve a large quantum versus classical complexity separation. To compute a basic finite multifunction in a quantum model only one query is enough while classically three queries are required. Then, we present two generalizations and a modification of the original algorithm, and obtain the following complexity gaps: Q UD (M′) ≤ N versus C UD (M′) ≥ 3N,…

STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES

1990

If x is a rational number, 0<x≤1, then A(x)c is a context-free language, where A(x) is the set of factors of the infinite Sturmian words with asymptotic density of 1’s smaller than or equal to x. We also prove a “gap” theorem i.e. A(x) can never be an unambiguous co-context-free language. The “gap” theorem is established by proving that the counting generating function of A(x) is transcendental. We show some links between Sturmian words, combinatorics and number theory.