Related papers: Isolated d.c.e. degrees and $\Sigma_1$ induction
Theorems on the existence of vector fields with given sets of Indexes of isolated Singular points are proved for the cases of closed manifolds, pairs of manifolds, manifolds with boundary, and gradient fields. It is proved that, on a…
For the notion of degree of categoricity, we study an analogous notion for punctual structures. We show that such notions coincide for non-$\Delta_{1}^{0}$-categorical injection structures, and construct an example of a…
We introduce a class of recursions defined over the $d$-dimensional integer lattice. The discrete equations we study are interpreted as higher dimensional extensions to the discrete Toda lattice equation. We shall prove that the equations…
This letter is about confinement in QCD. At the moment we have pictures of confinement to complete our understanding of the physics of strongly interacting particles, interaction which asks for confinement. As it is said in [1] : " In…
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…
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…
Reed conjectured that for every graph, $\chi \leq \left \lceil \frac{\Delta + \omega + 1}{2} \right \rceil$ holds, where $\chi$, $\omega$ and $\Delta$ denote the chromatic number, clique number and maximum degree of the graph, respectively.…
Obfuscation of computer programs has historically been approached either as a practical but \textit{ad hoc} craft to make reverse engineering subjectively difficult, or as a sound theoretical investigation unfortunately detached from the…
We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…
We study the general properties of commutative differential graded algebras in the category of representations over a reductive algebraic group with an injective central cocharacter. Besides describing the derived category of differential…
We investigate a variety of statistical properties associated with the number of distinct degrees that exist in a typical network for various classes of networks. For a single realization of a network with N nodes that is drawn from an…
We give complete descriptions of the tracial states on both the universal and reduced crossed products of a C*-dynamical system consisting of a unital C*-algebra and a discrete group. In particular, we also answer the question of when the…
We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…
In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…
The recent observation of superconductivity in twisted bilayer WSe$_2$ raises intriguing questions concerning the origin and the properties of superconducting states realized in bands with non-trivial topological properties and repulsive…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
The phenomenon of six degrees of separation is an old but interesting problem. The considerations of the clustering coefficient reflecting triangular structures and its extension to square one to six degrees of separation have been…
For any complex number $c$, let $\sigma_c\colon\mathbb N\rightarrow\mathbb C$ denote the divisor function defined by $\sigma_c(n)=\displaystyle{\sum_{d|n}d^c}$ for all $n\in\mathbb N$, and define $R(c)=\{\sigma_c(n)\in\mathbb C\colon…
We show that if $G$ is a connected graph of maximum degree at most $4$, which is not $C_{2,5}$, then the strong matching number of $G$ is at least $\frac{1}{9}n(G)$. This bound is tight and the proof implies a polynomial time algorithm to…
In this short note we show that every connected reductive simply-connected algebraic group of rank $>1$ over the complex numbers has infinitely many pairs of irreducible representations which are not related by an automorphism of the…