Temat: degree sequences - Prolib Integro

Skocz do pozycji: 1.

Tytuł:: Extremum degree sets of irregular oriented graphs and pseudodigraphs
Autorzy:: Dziechcińska-Halamoda, Zyta
Majcher, Zofia
Michael, Jerzy
Skupień, Zdzisław
Tematy:: irregular digraphs
degree sequences
degree sets; Pokaż więcej
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Powiązania:: https://bibliotekanauki.pl/articles/743975.pdf Link otwiera się w nowym oknie
Opis:: A digraph in which any two vertices have distinct degree pairs is called irregular. Sets of degree pairs for all irregular oriented graphs (also loopless digraphs and pseudodigraphs) with minimum and maximum size are determined. Moreover, a method of constructing corresponding irregular realizations of those sets is given.
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Gowers norms for automatic sequences
Autorzy:: Müllner, Clemens
Konieczny, Jakub
Byszewski, Jakub
Opis:: We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than guaranteed by the Arithmetic Regularity Lemma. For sequences produced by strongly connected and prolongable automata, the structured part is rationally almost periodic, while for general sequences the description is marginally more complicated. In particular, we show that all automatic sequences orthogonal to periodic sequences are Gowers uniform. As an application, we obtain for any $l$≥2 and any automatic set $A\subset \mathbb{N}_{0}$ lower bounds on the number of $l$-term arithmetic progressions - contained in A - with a given difference. The analogous result is false for general subsets of $\mathbb{N}_{0}$ and progressions of length ≥5.
Dostawca treści:: Repozytorium Uniwersytetu Jagiellońskiego

Artykuł

Informacja