Báo cáo toán học: " Playing Nim on a simplicial complex" pptx

... be a simplicial complex and B a collection of subsets of ∆ such that Conditions (A) , (B), and (C) are satisfied. Then B is said to be a Nim- basis for ∆. A simplicial complex which has a Nim- basis ... for all v ∈ V . We note that classical Nim also is a special case of the game considered in Proposition 4.7. An important class of binary matroids is the class of graphical...

Ngày tải lên: 07/08/2014, 06:20

... filtration in A θ is introduced exactly as in the part icular case θ = 1. We still have a canonical isomorphism of graded a lg ebras gr (A θ ) ≃ Λ and a canonical isomorphism of filtered algebras A ... but can be made completely self-contained. In particular, no information on Jack polynomials is required. The argument is based on a remarkable idea due to S. Kerov [5] and some...

Ngày tải lên: 08/08/2014, 12:22

... is at least 4|P |. Since every g r aph of of average degree d contains a non-empty subgraph of minimum degree at least d/2, the graph G contains a subgraph G ′ of minimum degree at least 2|P ... contain a subposet P is replaced by the weaker premise that F does not contain P as an induced subposet. Acknowledgement. I thank M´at´e Matolcsi for reading a preliminary version of this pape...

Ngày tải lên: 08/08/2014, 01:20

... Krattenthaler, An alternative evaluation of the Andrews–Burge determinant, in: Mathemati- cal Essays in Honor of Gian-Carlo Rota, B. E. Sagan, R. P. Stanley, Progress in Math., vol. 161, Birkh¨auser [6] ... 161, Birkh¨auser [6] C. Krattenthaler, Generating functions for plane partitions of a given shape, Manuscripta Math. 69, (1990), 173–202. [7] P .A. MacMahon, Combinatory Analysis, vol. 2...

Ngày tải lên: 07/08/2014, 06:20

... They define the separation distance of a Markov chain K started at x as s(r) = max y  1 − K r (x, y) π(y)  and the maximal separation distance of the Markov chain K as s ∗ (r) = max x,y  1 − K r (x, ... quantifying the convergence rate of a Markov chain on a state space X to its stationary distribution; we use the maximal separation distance after r steps, defined as s ∗ (r) := max x...

Ngày tải lên: 08/08/2014, 01:20

... diagram p Φ // ρ  lh  ? ? ? ? ? ? ? rc ρ  lh ~~ ~ ~ ~ ~ ~ ~ ~ ~ • Φ // ρ  • ρ  • Φ // • • Φ // lh ?? ~ ~ ~ ~ ~ ~ ~ • lh ` `A A A A A A A A This diagram should be viewed as a “cube”, the large outside square being the front face and the small inside square being the back face, the four trapezoids between ... b ′ . 2.2 Rigged configurations A general definition of rigged confi...

Ngày tải lên: 08/08/2014, 12:22

... Christiane Fell- baum, editor, WordNet: An Electronic Lexi- cal Database. MIT Press, Cambridge, MA. Christian Jacquemin. 1999. Syntagmatic and paradigmatic representation of term vaxia- tion. ... words and variation patterns defined as all the 4wl w2 is an abbreviated notation for a phrase that contains the two content words wl and w2 such that one of both is the head word and t...

Ngày tải lên: 31/03/2014, 04:20

... SLAAC configuration time (analysis and simulation) for the Sparse sce- nario. Figure 13: ETSI SLAAC configuration time (analysis and simulation with OMNeT++). Figure 14: ETSI SLAAC configuration ... in geonetworking-enabled VANETs: characterization and evaluation of the ETSI solution Marco Gramaglia ∗1,2 , Carlos J Bernardos 2 , Ignacio Soto 3 , Maria Calderon 2 and Roberto Baldessari 4 1 Instit...

Ngày tải lên: 20/06/2014, 20:20

... S Calinon, P Evrard, E Gribovskaya, A Billard, A Kheddar, Learning collaborative manip- ulation tasks by demonstration using a haptic interface, in Proc. Intl Conf. on Advanced Robotics (ICAR), ... κ P and κ V are adaptive stiffness and damping gains in the plane of the circle. κ P ⊥ and κ V ⊥ are constant gains in a direction perpendicular to the circle. The variable scalar gains κ...

Ngày tải lên: 20/06/2014, 20:20

... by Liu and Yang and Heittokangas et al. 1 Introduction and main results In this ar ticle, we shall assume that the reader is familiar with the fundamental results and the standard notations of ... established a version of Nevanlinna theory based on difference operators. Ishizaki and Yanagihara [6] developed a version of Wiman-Valiron theory for difference equations of entire functions ....

Ngày tải lên: 20/06/2014, 21:20