Author(s) Ayusawa, Ko; Yoshida, Eiichi; Imamura, Yumeko; Tanaka, Takayuki Citation Advanced Robotics, 30(8): 519-534 Issue Date 2016-04-18 Doc URL http://hdl.handle.net/2115/65110 Right This is an Accepted Manuscript of an article published by Taylor & Francis in Advanced Robotics on 18 April 2016, available online: http://www.tandfonline.com/10.1080/01691864.2016.1145596. Type article (author ...

1. Throughout this paper, c 1 , c2 , . . . denote absolute constants ; ko (a, fl, . . .), kr (a, f3, . . .), . . ., xo (a, /3, . . .), . . . denote constants depending only on the parameters a, /l, . . . ; v(n) denotes the number of the prime factors of the positive integer n, counted according to their multiplicity . The number of the elements of a finite set S is denoted by I S I . Let k, n b...

This paper investigates t-intersecting families of injections, where two injections a, b from [k] to [n] t-intersect if there exists X ⊆ [k] with |X| ≥ t such that a(x) = b(x) for all x ∈ X. We prove that if F is a 1-intersecting injection family of maximal size then all elements of F have a fixed image point in common. We show that when n is large in terms of k and t, the set of injections whi...

For a graph G and integer r ≥ 1 we denote the collection of independent r-sets of G by I (r)(G). If v ∈ V (G) then I (r) v (G) is the collection of all independent r-sets containing v. A graph G, is said to be r-EKR, for r ≥ 1, iff no intersecting family A ⊆ I (r)(G) is larger than maxv∈V (G) |I v (G)|. There are various graphs which are known to have his property: the empty graph of order n ≥ ...

Given a set of n real numbers, if the sum of the elements of every subset of size larger than k is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is (n−1 k−1 ) + (n−1 k−2 ) + · · ·+ (n−1 0 ) + 1, settling a problem of Tsukerman. We provide two proofs; the first establishes and applies a weighted version of Hall’s theorem, and the second ...

Let X be a proper variety defined over a field K. Following [Ma], we say that two points x, x′ ∈ X(K) are R-equivalent if they can be connected by a chain of rational curves defined over K (cf. (4.1)). In essence, two points are R-equivalent if they are “obviously” rationally equivalent. Several authors have proved finiteness results over local and global fields (cubic hypersurfaces [Ma], [SD],...

be a positive definite quadratic form with determinant D R and integer coefficients a ;Call it an even form if all a ; ; are even ., an odd form if at least one a ;; is odd . Then Í,, is called non-decomposable, if it cannot be expressed as a sum of two non-negative quadratic forms with integer coefficients . Mordell 1 ) proved that f, can always be decomposed into a sum of five squares of line...

In terms of the notion of a specific class of ranked semilattices, called regular quantum matroids, we prove the Erdiis-Kc-Rado-type results in a unified way for the association schemes J,(n,d) of vector spaces and H,(n,d) of bilinear forms, together with their Delsarte t-designs, respectively. @ 1999 Elsevier Science B.V. All rights reserved

Learner corpora consist of texts produced by second language (L2) learners. I We present ALeS Ko, a learner corpus of Chinese L2 learners of German and discuss the multi-layer annotation of the left sentence periphery notably the Vorfeld.