scholarly journals Biased weak polyform achievement games

2014 ◽  
Vol Vol. 16 no. 3 (Combinatorics) ◽  
Author(s):  
Ian Norris ◽  
Nándor Sieben
Keyword(s):  
Winning Strategies ◽  
International Audience ◽  
New Type

Combinatorics International audience In a biased weak (a,b) polyform achievement game, the maker and the breaker alternately mark a,b previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the (a,b) game can be built from winning strategies for games involving fewer marks for the maker and the breaker. A new type of breaker strategy called the priority strategy is introduced. The winners are determined for all (a,b) pairs for polyiamonds and polyominoes up to size four.

scholarly journals Tiling Periodicity

2010 ◽  
Vol Vol. 12 no. 2 ◽  
Author(s):  
Juhani Karhumaki ◽  
Yury Lifshits ◽  
Wojciech Rytter
Keyword(s):  
Open Problem ◽  
Classical Case ◽  
Side Product ◽  
Compact Representation ◽  
Minimal Size ◽  
Partial Word ◽  
International Audience ◽  
New Type

International audience We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a lozenge b is a tiling period of a a b b. We investigate properties of tiling periodicities and design an algorithm working in O(n log (n) log log (n)) time which finds a tiling period of minimal size, the number of such minimal periods and their compact representation. The combinatorics of tiling periods differs significantly from that for classical full periods, for example unlike the classical case the same word can have many different primitive tiling periods. We consider also a related new type of periods called in the paper multi-periods. As a side product of the paper we solve an open problem posted by T. Harju (2003).

scholarly journals Avoider-enforcer star games

2015 ◽  
Vol Vol. 17 no. 1 (Combinatorics) ◽  
Author(s):  
Andrzej Grzesik ◽  
Mirjana Mikalački ◽  
Zoltán Lóránt Nagy ◽  
Alon Naor ◽  
Balázs Patkós ◽  
...  
Keyword(s):  
Complete Graph ◽  
Order Of Magnitude ◽  
Winning Strategies ◽  
International Audience

Combinatorics International audience In this paper, we study (1 : b) Avoider-Enforcer games played on the edge set of the complete graph on n vertices. For every constant k≥3 we analyse the k-star game, where Avoider tries to avoid claiming k edges incident to the same vertex. We consider both versions of Avoider-Enforcer games — the strict and the monotone — and for each provide explicit winning strategies for both players. We determine the order of magnitude of the threshold biases fmonF, f-F and f+F, where F is the hypergraph of the game.

scholarly journals Chromatic Turán problems and a new upper bound for the Turán density of $\mathcal{K}_4^-$

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
John Talbot
Keyword(s):  
Upper Bound ◽  
Turan Problems ◽  
International Audience ◽  
New Type ◽  
Extremal Hypergraph

International audience We consider a new type of extremal hypergraph problem: given an $r$-graph $\mathcal{F}$ and an integer $k≥2$ determine the maximum number of edges in an $\mathcal{F}$-free, $k$-colourable $r$-graph on $n$ vertices. Our motivation for studying such problems is that it allows us to give a new upper bound for an old problem due to Turán. We show that a 3-graph in which any four vertices span at most two edges has density less than $\frac{33}{ 100}$, improving previous bounds of $\frac{1}{ 3}$ due to de Caen [1], and $\frac{1}{ 3}-4.5305×10^-6$ due to Mubayi [9].

scholarly journals Sorting and preimages of pattern classes

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Anders Claesson ◽  
Henning Úlfarsson
Keyword(s):  
Permutation Pattern ◽  
International Audience ◽  
New Type ◽  
Standing Problem

International audience We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations that are completely sorted when passed twice through a stack, in terms of patterns. We also solve the long-standing problem of describing West-3-stack-sortable permutations. This requires a new type of generalized permutation pattern we call a decorated pattern. On introduit un algorithme qui détermine quand un opérateur de tri (tels que le tri par une pile, ou le tri-bulle) produit un motif donnè en sortie. Cet algorithme fournit une nouvelle preuve de la caractérisation des permutations 2-triables au sens de West (c'est-à-dire des permutations qui sont triées complètement par deux passages dans une pile) par des motifs interdits. On résout aussi le problème longtemps ouvert de la caractérisation des permutations 3-triables au sens de West. Ceci demande de définir un nouveau type de motifs généralisés, appelè motif décoré.

scholarly journals Scheduling Problems and Generalized Graph Coloring

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
John Machacek
Keyword(s):  
Graph Coloring ◽  
Symmetric Function ◽  
Vertex Coloring ◽  
Scheduling Problems ◽  
International Audience ◽  
New Type ◽  
Chromatic Symmetric Function ◽  
Special Case

International audience We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, andsimplicial complexes. To this coloring there is an associated symmetric function in noncommuting variables for whichwe give a deletion-contraction formula. In the case of graphs our symmetric function in noncommuting variablesagrees with the chromatic symmetric function in noncommuting variables of Gebhard and Sagan. Our vertex coloringis a special case of the scheduling problems defined by Breuer and Klivans. We show how the deletion-contractionlaw can be applied to scheduling problems.

scholarly journals Weak Positional Games on Hypergraphs of Rank Three

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Martin Kutz
Keyword(s):  
Polynomial Time ◽  
Optimal Strategies ◽  
Decomposition Theorem ◽  
Positional Games ◽  
Almost Disjoint ◽  
International Audience ◽  
New Type

International audience In a weak positional game, two players, Maker and Breaker, alternately claim vertices of a hypergraph until either Maker wins by getting a complete edge or all vertices are taken without this happening, a Breaker win. For the class of almost-disjoint hypergraphs of rank three (edges with up to three vertices only and edge-intersections on at most one vertex) we show how to find optimal strategies in polynomial time. Our result is based on a new type of decomposition theorem which might lead to a better understanding of weak positional games in general.

The Microstructure of Shock-Synthesized Diamond

1967 ◽  
Vol 25 ◽  
pp. 324-325
Author(s):  
Lucien F. Trueb
Keyword(s):  
Single Crystals ◽  
Preferred Orientation ◽  
High Magnification ◽  
Texture Pattern ◽  
Shock Process ◽  
New Type ◽  
Diffraction Diagram

A new type of synthetic industrial diamond formed by an explosive shock process has been recently developed by the Du Pont Company. This material consists of a mixture of two basically different forms, as shown in Figure 1: relatively flat and compact aggregates of acicular crystallites, and single crystals in the form of irregular polyhedra with straight edges.Figure 2 is a high magnification micrograph typical for the fibrous aggregates; it shows that they are composed of bundles of crystallites 0.05-0.3 μ long and 0.02 μ. wide. The selected area diffraction diagram (insert in Figure 2) consists of a weak polycrystalline ring pattern and a strong texture pattern with arc reflections. The latter results from crystals having preferred orientation, which shows that in a given particle most fibrils have a similar orientation.

New type electron gun with electrostatic and electromagnetic lenses

1978 ◽  
Vol 36 (1) ◽  
pp. 62-63
Author(s):  
T. Ichinokawa ◽  
H. Maeda
Keyword(s):  
Electron Microscopy ◽  
Electron Beam ◽  
Optimum Condition ◽  
Bias Voltage ◽  
Electron Gun ◽  
Charge Effect ◽  
Micro Fabrication ◽  
Maximum Brightness ◽  
New Type ◽  
The Ideal

I. IntroductionThermionic electron gun with the Wehnelt grid is popularly used in the electron microscopy and electron beam micro-fabrication. It is well known that this gun could get the ideal brightness caluculated from the Lengumier and Richardson equations under the optimum condition. However, the design and ajustment to the optimum condition is not so easy. The gun has following properties with respect to the Wehnelt bias; (1) The maximum brightness is got only in the optimum bias. (2) In the larger bias than the optimum, the brightness decreases with increasing the bias voltage on account of the space charge effect. (3) In the smaller bias than the optimum, the brightness decreases with bias voltage on account of spreading of the cross over spot due to the aberrations of the electrostatic immersion lens.In the present experiment, a new type electron gun with the electrostatic and electromagnetic lens is designed, and its properties are examined experimentally.

A new type of defect structure in 124-superconducting oxide revealed by HREM

1991 ◽  
Vol 49 ◽  
pp. 1092-1093
Author(s):  
R. Sharma ◽  
B.L. Ramakrishna ◽  
N.N. Thadhani ◽  
D. Hianes ◽  
Z. Iqbal
Keyword(s):  
Shock Wave ◽  
Defect Structure ◽  
Neutron Radiation ◽  
Weak Links ◽  
Defect Structures ◽  
New Materials ◽  
New Type ◽  
Current Densities ◽  
Processing Techniques ◽  
Microstructural Studies

After materials with superconducting temperatures higher than liquid nitrogen have been prepared, more emphasis has been on increasing the current densities (Jc) of high Tc superconductors than finding new materials with higher transition temperatures. Different processing techniques i.e thin films, shock wave processing, neutron radiation etc. have been applied in order to increase Jc. Microstructural studies of compounds thus prepared have shown either a decrease in gram boundaries that act as weak-links or increase in defect structure that act as flux-pinning centers. We have studied shock wave synthesized Tl-Ba-Cu-O and shock wave processed Y-123 superconductors with somewhat different properties compared to those prepared by solid-state reaction. Here we report the defect structures observed in the shock-processed Y-124 superconductors.

ESEM - A multipurpose surface Electron Microscope

1986 ◽  
Vol 44 ◽  
pp. 632-633 ◽  
Author(s):  
G.D. Danilatos
Keyword(s):  
Electron Microscope ◽  
Room Temperature ◽  
Environmental Scanning ◽  
Gas Composition ◽  
Saturated Water Vapor ◽  
Surface Electron ◽  
Current State ◽  
Saturated Water ◽  
New Type ◽  
Temperature And Pressure

Over recent years a new type of electron microscope - the environmental scanning electron microscope (ESEM) - has been developed for the examination of specimen surfaces in the presence of gases. A detailed series of reports on the system has appeared elsewhere. A review summary of the current state and potential of the system is presented here.The gas composition, temperature and pressure can be varied in the specimen chamber of the ESEM. With air, the pressure can be up to one atmosphere (about 1000 mbar). Environments with fully saturated water vapor only at room temperature (20-30 mbar) can be easily maintained whilst liquid water or other solutions, together with uncoated specimens, can be imaged routinely during various applications.

Sign in / Sign up

Export Citation Format

Share Document