Sciweavers

APAL
2005
67views more  APAL 2005»
13 years 4 months ago
Free abelian lattice-ordered groups
Abstract. Let n be a positive integer and FA (n) be the free abelian latticeordered group on n generators. We prove that FA (m) and FA (n) do not satisfy the same first-order sente...
Andrew M. W. Glass, Angus Macintyre, Franço...
RSA
2006
81views more  RSA 2006»
13 years 4 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
ENDM
2007
96views more  ENDM 2007»
13 years 5 months ago
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
Jacob Fox, Veselin Jungic, Rados Radoicic
EJC
2007
13 years 5 months ago
Constructing t-designs from t-wise balanced designs
We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all ...
John P. McSorley, Leonard H. Soicher
JSC
2008
55views more  JSC 2008»
13 years 5 months ago
Algorithms for a class of infinite permutation groups
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m...
Stefan Kohl
JSC
2008
58views more  JSC 2008»
13 years 5 months ago
A Groebner basis approach to solve a Conjecture of Nowicki
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
Joseph Khoury
JGT
2008
61views more  JGT 2008»
13 years 5 months ago
Irregularity strength of dense graphs
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
Bill Cuckler, Felix Lazebnik
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 5 months ago
Computing Integer Powers in Floating-Point Arithmetic
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We ...
Peter Kornerup, Vincent Lefèvre, Jean-Miche...
COMBINATORICS
2007
90views more  COMBINATORICS 2007»
13 years 5 months ago
Distinguishability of Locally Finite Trees
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
Mark E. Watkins, Xiangqian Zhou
COMBINATORICS
2007
58views more  COMBINATORICS 2007»
13 years 5 months ago
The Initial Involution Patterns of Permutations
For a permutation π = π1π2 · · · πn ∈ Sn and a positive integer i ≤ n, we can view π1π2 · · · πi as an element of Si by order-preserving relabeling. The j-set of ...
Dongsu Kim, Jang Soo Kim