Results 1  10
of
47,639
The combinatorial characterization of Assur graphs
, 2008
"... We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology, questions, methods and conjectures from the kinematics terminology for one degree of freedom linkages to the terminolog ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
to the terminology of Assur graphs as graphs with special properties in rigidity theory. Exploiting recent works in combinatorial rigidity theory we provide mathematical characterizations of these graphs derived from ‘minimal ’ linkages. With these characterizations, we confirm a series of conjectures posed by Offer
A Combinatorial Characterization of Resolution Width
 In 18th IEEE Conference on Computational Complexity
, 2002
"... We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result i ..."
Abstract

Cited by 52 (6 self)
 Add to MetaCart
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result
Combinatorial characterization of readonce formulae
, 2002
"... We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called ReadOnce. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results of Seymo ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose formula size is exactly the number of variables. Those functions are called ReadOnce. We use methods of combinatorial optimization and give as a corollary an alternative proof for some results
Combinatorial Characterizations of Authentication Codes II
 Designs, Codes and Cryptography
, 1996
"... For any authentication code for k source states and v messages having minimum possible deception probabilities (namely, P d 0 = k=v and P d 1 = (k \Gamma 1)=(v \Gamma 1)), we show that there must be at least v encoding rules. (This can be thought of as an authenticationcode analogue of Fisher&apos ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
's Inequality. ) We derive several properties that an extremal code must satisfy, and we characterize the extremal codes for equiprobable source states as arising from symmetric balanced incomplete block designs. We also present an infinite class of extremal codes, in which the source states
Combinatorial characterizations of generalized CohenMacaulay monomial ideals
 Bull. Math. Soc. Sci. Math. Roumanie (N.S
"... Abstract. We give a generalization of Hochster’s formula for local cohomologies of squarefree monomial ideals to monomial ideals, which are not necessarily squarefree. Using this formula, we give combinatorial characterizations of generalized CohenMacaulay monomial ideals. We also give other appl ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
Abstract. We give a generalization of Hochster’s formula for local cohomologies of squarefree monomial ideals to monomial ideals, which are not necessarily squarefree. Using this formula, we give combinatorial characterizations of generalized CohenMacaulay monomial ideals. We also give other
Combinatorial characterization of independent transducers via functional digraphs
"... Abstract. We investigate the asymptotic independence of the sum of the input digits and the sum of the output digits of a transducer. First, we provide an algebraic description of transducers whose input and output sums are independent. Furthermore, we give a combinatorial characterization in terms ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We investigate the asymptotic independence of the sum of the input digits and the sum of the output digits of a transducer. First, we provide an algebraic description of transducers whose input and output sums are independent. Furthermore, we give a combinatorial characterization
A combinatorial characterization of the Hermitian surface
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 46 (2010), PAGES 101–107
, 2010
"... In this paper we prove that in a projective space of dimension three and square order q 2 a(q 5 + q 3 + q 2 + 1)set having no external line, of type (m, n) 2 and meeting every affine plane in at least (q 3 − q 2)pointsisa Hermitian surface. ..."
Abstract
 Add to MetaCart
In this paper we prove that in a projective space of dimension three and square order q 2 a(q 5 + q 3 + q 2 + 1)set having no external line, of type (m, n) 2 and meeting every affine plane in at least (q 3 − q 2)pointsisa Hermitian surface.
Results 1  10
of
47,639