作  者
期刊 & 会议
年  份
David L. Wehlau 的引文(42) 排序方式:
Hedetniemi’s Conjecture and Dense Boolean Lattices  
The category of finite directed graphs is Cartesian closed, hence it has a product and exponential objects. For a fixed K, let be the class of all directed graphs of the form K G , preordered by th......
A Journal on The Theory of Ordered Sets and Its Applications  2011
0次引用 0 0
Interleaved adjoints on directed graphs  
For an integer k >= 1, the k-th interlacing adjoint of a digraph G is the digraph i_k(G) with vertex-set V(G)^k, and arcs ((u_1, ..., u_k), (v_1, ..., v_k)) such that (u_i,v_i) \in A(G) for i = 1, .........
 2009
0次引用 0 0
Hedetniemi's conjecture and dense boolean lattices  
The category D of finite directed graphs is cartesian closed, hence it has a product and exponential objects. For a fixed K, let KD be the class of all directed graphs of the form KG, preordered by th......
 2009
0次引用 0 0
Classification and Constructions of Complete Caps in Binary Spaces  
We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We repor......
Designs, Codes and Cryptography  2006
2次引用 0 0
Invariants of the Diagonal Cp-action on V3  
Abstract. Let Cp denote the cyclic group of order p where p ≥ 3 is prime. We denote by V3 the indecomposable three dimensional representation of Cp over a field F of characteristic p. We compute a set......
SAGBI BASIS FOR F Cp 11  2006
1次引用 0 0
Classification and Constructions of Complete Caps in Binary Spaces  
We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We repor......
Designs, Codes and Cryptography  2006
2次引用 0 0
Presentation Theorems for Coded Character Sets  
The notion of 'presentation', as used in combinatorial group theory, is applied to coded character sets(CCSs) - sets which facilitate the interchange of messages in a digital computer network(DCN) . B......
Computing Research Repository  2006
0次引用 0 0
Classification and Constructions of Complete Caps in Binary Spaces  
We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We repor......
Designs, Codes and Cryptography  2006
2次引用 0 0
The Noether numbers for cyclic groups of prime order  
Abstract. The Noether number of a representation is the largest degree of an element in a minimal homogeneous generating set for the corresponding ring of invariants. We compute the Noether number for......
 2005
1次引用 0 0
Constructions of Small Complete Caps in Binary Projective Spaces  
In the binary projective spaces PG(n,2) k-caps are called large if k > 2n-1 and smallif k ≤ 2n-1. In this paper we propose new constructions producing infinite families of small binary complete caps.......
Designs, Codes and Cryptography  2005
0次引用 0 0

1/5 第一页 上一页 1 2 3 4 5 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜