Search results for "combinatoric"
showing 10 items of 1776 documents
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Upper bounds on multiparty communication complexity of shifts
1996
We consider some communication complexity problems which arise when proving lower bounds on the complexity of Boolean functions. In particular, we prove an \(O(\frac{n}{{2\sqrt {\log n} }}\log ^{1/4} n)\)upper bound on 3-party communication complexity of shifts, an O(n e ) upper bound on the multiparty communication complexity of shifts for a polylogarithmic number of parties. These bounds are all significant improvements over ones recently considered “unexpected” by Pudlak [5].
Properties and constraints of cheating-immune secret sharing schemes
2006
AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…
Relations frequency hypermatrices in mutual, conditional and joint entropy-based information indices.
2012
Graph-theoretic matrix representations constitute the most popular and significant source of topological molecular descriptors (MDs). Recently, we have introduced a novel matrix representation, named the duplex relations frequency matrix, F, derived from the generalization of an incidence matrix whose row entries are connected subgraphs of a given molecular graph G. Using this matrix, a series of information indices (IFIs) were proposed. In this report, an extension of F is presented, introducing for the first time the concept of a hypermatrix in graph-theoretic chemistry. The hypermatrix representation explores the n-tuple participation frequencies of vertices in a set of connected subgrap…
Volume-convergent sequences of Haken 3-manifolds
2003
Abstract Let M be a closed orientable 3-manifold and let Vol(M) denote its Gromov simplicial volume. This paper is devoted to the study of sequences of non-zero degree maps f i :M→N i to Haken manifolds. We prove that any sequence of Haken manifolds (Ni,fi), satisfying limi→∞deg(fi)×Vol(Ni)=Vol(M) is finite up to homeomorphism. As an application, we deduce from this fact that any closed orientable 3-manifold with zero Gromov simplicial volume and in particular any graph manifold dominates at most finitely many Haken 3-manifolds. To cite this article: P. Derbez, C. R. Acad. Sci. Paris, Ser. I 336 (2003).
Clarkson-McCarthy inequalities with unitary and isometry orbits
2020
Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .
Trace and density results on regular trees
2019
We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.
Local maximal operators on fractional Sobolev spaces
2016
In this note we establish the boundedness properties of local maximal operators MG on the fractional Sobolev spaces Ws;p(G) whenever G is an open set in Rn, 0 < s < 1 and 1 < p < 1. As an application, we characterize the fractional (s;p)-Hardy inequality on a bounded open set by a Maz'ya-type testing condition localized to Whitney cubes. pq(G) whenever G is an open set in R n , 0 < s < 1 and 1 < p;q <1. Our main focus lies in the mapping properties of MG on a fractional Sobolev space W s;p (G) with 0 < s < 1 and 1 < p < 1, see Section 2 for the denition or (3) for a survey of this space. The intrinsically dened function space W s;p (G) on a given domain G coincides with the trace space F s …
Highly transitive actions of free products
2013
We characterize free products admitting a faithful and highly transitive action. In particular, we show that the group $\PSL_2(\Z)\simeq (\Z/2\Z)*(\Z/3\Z)$ admits a faithful and highly transitive action on a countable set.
Algebraic (2, 2)-transformation groups
2009
This paper contains the more significant part of the article with the same title that will appear in the Volume 12 of Journal of Group Theory (2009). In this paper we determine all algebraic transformation groups $G$, defined over an algebraically closed field $\sf k$, which operate transitively, but not primitively, on a variety $\Omega$, provided the following conditions are fulfilled. We ask that the (non-effective) action of $G$ on the variety of blocks is sharply 2-transitive, as well as the action on a block $\Delta$ of the normalizer $G_\Delta$. Also we require sharp transitivity on pairs $(X,Y)$ of independent points of $\Omega$, i.e. points contained in different blocks.