Related papers: Bi-Isolated d.c.e. Degrees and $\Sigma_1$ Inductio…
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…
We propose a unified mathematical scheme, based on a classical tensor isomorphism, for characterizing entanglement that works for pure states of multipartite systems of any number of particles. The degree of entanglement is indicated by a…
Sieves are constructed for twin primes in class I, which are of the form 2m+/-D, D>=3 odd. They are characterized by their twin-D-I rank m. They have no parity problem. Non-rank numbers are identified and counted using odd primes p>=5.…
An isolating set of a graph is a set of vertices $S$ such that, if $S$ and its neighborhood is removed, only isolated vertices remain; and the isolation number is the minimum size of such a set. It is known that for every connected graph…
We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…
We introduce and study doubly twisted near-isometries. A doubly twisted near-isometry is a tuple of near-isometries satisfying certain relations determined by a prescribed family of unitaries, thereby generalizing the notion of doubly…
An identifying code of a closed-twin-free graph $G$ is a dominating set $S$ of vertices of $G$ such that any two vertices in $G$ have a distinct intersection between their closed neighborhoods and $S$. It was conjectured that there exists…
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…
The \textsc{Degree Realization} problem with respect to a graph family $\mathcal{F}$ is defined as follows. The input is a sequence $d$ of $n$ positive integers, and the goal is to decide whether there exists a graph $G \in \mathcal{F}$…
We examine the degree spectra of relations on ${(\omega, <)}$. Given an additional relation $R$ on ${(\omega,<)}$, such as the successor relation, the degree spectrum of $R$ is the set of Turing degrees of $R$ in computable copies of…
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
For $\Delta$ a finite connected nontrivial directed multigraph, we prove: 1. $\Delta$ has a directed circuit using each directed edge exactly once if and only if both each pair of distinct vertices of $\Delta$ occur in a common directed…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks,…
This paper aims to provide a careful and self-contained introduction to the theory of topological degree in Euclidean spaces. It is intended for people mostly interested in analysis and, in general, a heavy background in algebraic or…
Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$. If $H$ contains no isolated vertex and $deg(u)+ deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$…
An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…
In this paper we investigate the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo rooted branching bisimilarity, which is a classic, bisimulation-based notion of equivalence that abstracts from…