Results 21 to 30 of about 18,397 (132)

Equitable colourings of Borel graphs

open access: yesForum of Mathematics, Pi, 2021
Hajnal and Szemerédi proved that if G is a finite graph with maximum degree $\Delta $ , then for every integer $k \geq \Delta +1$ , G has a proper colouring with k colours in which every two colour classes differ in size at most by $1$ ;
Anton Bernshteyn, Clinton T. Conley
doaj   +1 more source

An Introduction to Time-Constrained Automata [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals.
Matthieu Lemerre   +3 more
doaj   +1 more source

Structural and Spectral Properties of Deterministic Aperiodic Optical Structures

open access: yesCrystals, 2016
In this comprehensive paper we have addressed structure-property relationships in a number of representative systems with periodic, random, quasi-periodic and deterministic aperiodic geometry using the interdisciplinary methods of spatial point pattern ...
Luca Dal Negro   +2 more
doaj   +1 more source

A dual graph construction for higher-rank graphs, and $K$-theory for finite 2-graphs [PDF]

open access: yes, 2004
Given a $k$-graph $\Lambda$ and an element $p$ of $\NN^k$, we define the dual $k$-graph, $p\Lambda$. We show that when $\Lambda$ is row-finite and has no sources, the $C^*$-algebras $C^*(\Lambda)$ and $C^*(p\Lambda)$ coincide.
Allen, Stephen, Pask, David, Sims, Aidan
core   +3 more sources

A Direct Construction of Inter-Group Complementary Code Set

open access: yesIEEE Access, 2018
Complete complementary codes (CCCs) is a collection of mutually orthogonal complementary codes and Inter-group complementary (IGC) code set consists of multiple disjoint groups of 2-D codes.
Palash Sarkar   +3 more
doaj   +1 more source

Asymptotic -Algebras from -Actions on Higher Rank Graphs

open access: yesAbstract and Applied Analysis, 2013
For a dynamical system arising from -action on a higher rank graph with finite vertex set, we show that the semidirect product of the asymptotic equivalence relation groupoid is essentially principal if and only if the -graph satisfies the aperiodic ...
Inhyeop Yi
doaj   +1 more source

Invariant Measures on Stationary Bratteli Diagrams [PDF]

open access: yes, 2008
We study dynamical systems acting on the path space of a stationary (non-simple) Bratteli diagram. For such systems we explicitly describe all ergodic probability measures invariant with respect to the tail equivalence relation (or the Vershik map ...
Bezuglyi, S.   +3 more
core   +3 more sources

Abelian bordered factors and periodicity [PDF]

open access: yes, 2014
A finite word u is said to be bordered if u has a proper prefix which is also a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely periodic if and only if it contains only finitely many unbordered ...
Charlier, Emilie   +3 more
core   +2 more sources

The cycline subalgebra of a Kumjian-Pask algebra [PDF]

open access: yes, 2016
Let $\Lambda$ be a row-finite higher-rank graph with no sources. We identify a maximal commutative subalgebra $\mathcal{M}$ inside the Kumjian-Pask algebra ${\rm KP}_R(\Lambda)$.
Canto, Cristóbal Gil   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy