相关论文: Organization of parameter space for simple circle …

In network coding, a flag code is a collection of flags, that is, sequences of nested subspaces of a vector space over a finite field. Due to its definition as the sum of the corresponding subspace distances, the flag distance parameter…

The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP).…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

We develop a constructive framework for designing radio-frequency (RF) trap networks from planar data and show that non-smooth field-free guide lines are possible in such networks. Given analytic Cauchy data on a symmetry plane, namely the…

Recent studies uncovered important core/periphery network structures characterizing complex sets of cooperative and competitive interactions between network nodes, be they proteins, cells, species or humans. Better characterization of the…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove…

The concept of structured occurrence nets is an extension of that of occurrence nets which are directed acyclic graphs that represent causality and concurrency information concerning a single execution of a distributed system. The formalism…

Motivated by some computations of Feynman integrals and certain conjectures on mixed Tate motives, Bejleri and Marcolli posed questions about the $\mathbb{F}_1$-structure (in the sense of torification) on the complement of a hyperplane…

We study properties of classes of closure operators and closure systems parameterized by systems of isotone Galois connections. The parameterizations express stronger requirements on idempotency and monotony conditions of closure operators.…

Area preserving maps provide the simplest and most accurate means to visualize and quantify the behavior of nonlinear systems. Convenience of the mapping equations of motion for investigation of transition to chaotic behavior in dynamics of…

A fullerene graph can be embedded in a piecewise linear 2-manifold with each non-hexagonal carbon ring corresponding to a cone vertex. Adjacent two or three such vertices can be combined as a cluster cut out from a parent cone round a…

We present a systematic study for the limit closure $(\underline{x})^{\lim}$ of a sequence of elements $\underline{x}$ (eg. a system of of parameters) in a local ring. Firstly, we answer the question which elements are always contained in…

The space of degree d single-variable monic and centered complex polynomial vector fields can be decomposed into loci in which the vector fields have the same topological structure. We analyze the geometric structure of these loci and…

In recent work, the author and others have studied compositional algebras of Petri nets. Here we consider mathematical aspects of the pure linking algebras that underly them. We characterise composition of nets without places as the…

We introduce a new combinatorial object called a web world that consists of a set of web diagrams. The diagrams of a web world are generalizations of graphs, and each is built on the same underlying graph. Instead of ordinary vertices the…

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes…

The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has been proposed as a vertex symmetric communication network. This network has been shown to have many remarkable communication properties such as…

Confidence nets, that is, collections of confidence intervals that fill out the parameter space and whose exact parameter coverage can be computed, are familiar in nonparametric statistics. Here, the distributional assumptions are based on…

Reaction networks, or equivalently Petri nets, are a general framework for describing processes in which entities of various kinds interact and turn into other entities. In chemistry, where the reactions are assigned "rate constants", any…