Related papers: Isolated d.c.e. degrees and $\Sigma_1$ induction
Let $D$ be an directed graph on $p\geq 10$ vertices with minimum degree at least $p-1$ and minimum semi-degree at least $ p/2 -1$. We present a detailed proof of the following result [13]: The digraph $D$ is pancyclic, unless some extremal…
The separability tensor element of a separable extension of noncommutative rings is an idempotent when viewed in the correct endomorphism ring; so one speaks of a separability idempotent, as one usually does for separable algebras. It is…
The question of whether a noncommutative graded quotient singularity $A^G$ is isolated depends on a subtle invariant of the $G$-action on $A$, called the pertinency. We prove a partial dichotomy theorem for isolatedness, which applies to a…
In this paper, we present a conjecture on the degree of unipotent characters in the cohomology of particular Deligne-Lusztig varieties for groups of Lie type, and derive consequences of it. These degrees are a necessary piece of data in the…
In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and order. Afterwards, we combine the results from our study of…
In this work we explore degree assortativity in complex networks, and extend its usual definition beyond that of nearest neighbours. We apply this definition to model networks, and describe a rewiring algorithm that induces assortativity.…
We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of the focal directions of research in property testing in the last 15 years. However, despite…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
In this paper, we study the joint behaviour of the degree, depth and label of and graph distance between high-degree vertices in the random recursive tree. We generalise the results obtained by Eslava and extend these to include the labels…
An important result in tilting theory states that a class of modules over a ring is a tilting class if and only if it is the Ext-orthogonal class to a set of compact modules of bounded projective dimension. Moreover, cotilting classes are…
This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs. The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties. The…
We study the problem of experimental design for accurately identifying the causal graph structure of a simple structural causal model (SCM), where the underlying graph may include both cycles and bidirected edges induced by latent…
In a field-theoretical context, we consider the Euclidean $(\phi^4+\phi^6)_D$ model compactified in one of the spatial dimensions. We are able to determine the dependence of the transition temperature ($T_{c}$)for a system described by this…
In a previous paper, entitled "Structural Highness Notions," we defined several classes of degrees that are high in senses related to computable structure theory. Each class of degrees is characterized by a structural feature (e.g., an…
Let D be a division algebra over a base field k. The homological transcendence degree of D, denoted by Htr D, is defined to be the injective dimension of the enveloping algebra of D. We show that Htr has several useful properties which the…
In a recent publication, it was shown that a large class of integrals over the unitary group U(n) satisfy difference equations over $n$, involving a finite number of steps; special cases are generating functions appearing in questions of…
The isolation number of a graph $G$ (also called the vertex-edge domination number of $G$), denoted by $\iota(G)$, is the size of a smallest subset $D$ of the vertex set $V(G)$ of $G$ such that $G-N[D]$ (the graph obtained by deleting the…
This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…
We propose that negative degree correlation among nodes in a network of nonlinear oscillators, often detected in real world networks, is motivated by its positive effects on synchronizability. In so doing, we use a novel methodology to…