Unless stated otherwise, graphs are unrooted. Recall that in our generating functions x marks vertices and y marks edges. Additionally we will distinguish whether edges are single edges, double edges or loops as they are treated differently when obt…

Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ …

Next table summarizes the known results for the time-complexity of the two basic questions concerning the rank.

A tropical matrix is a matrix defined over the max-plus semiring. For such matrices, there exist several non-coinciding notions of rank: the row rank…

We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds …

We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, w…

Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-…

We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a st…

The Arnoux-Rauzy-Poincar\'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar\'e algorithms. It is …

The role of unique node identifiers in network computing is well understood as far as symmetry breaking is concerned. However, the unique identifiers…

A flow sensitive security model is presented to analyse information flow in federated cloud systems. Each cloud and the entities of the cloud system are classified into different security levels which form a security lattice. Opacity — a general tec…

The extent and importance of cloud computing is rapidly increasing due to the ever increasing demand for internet services and communications. Instea…

The applications of topological algebra in automata theory and finite model theory, as well as in many parts of classical algebra, are mainly concerned with profinite algebras. In this section we restrict our attention to these. First, we give a cha…

Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra wit…

We construct a natural extension for each of Nakada's $\alpha$-continued fractions and show the continuity as a function of $\alpha$ of both the entr…

We now discuss the verification of Theorem 1.1 for the well-generated exceptional Shephard-Todd classification types. Those were listed in Table 1. In Table 3 in Appendix B, we summarize more detailed information concerning reflections, degrees, cod…

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simp…

In this section we extend the results of the previous section (where we obtained Theorem 1 for classes of forests) to general bridge-addable classes, concluding the proof of Theorem 1. In 4.1 we prove that graphs in ζ-tight bridge-addable classes te…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ i…

We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with a…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of t…

The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szem…

A Lorenz map, as defined, e.g., in [11], is a function f:[0,1]→[0,1] satisfying:

For a function from the unit interval to itself with constant slope and one discontinuity, the itineraries of the point of discontinuity are called t…

In this paper we study the problem of scheduling packets on directed line networks. Each node in the network has a local buffer of bounded size $B$, …

We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy so…

We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second pla…

We show that the quantum query complexity of detecting if an $n$-vertex graph contains a triangle is $O(n^{9/7})$. This improves the previous best al…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account