Related papers: Bi-Isolated d.c.e. Degrees and $\Sigma_1$ Inductio…
Topological insulators embody a new state of matter characterized entirely by the topological invariants of the bulk electronic structure rather than any form of spontaneously broken symmetry. Unlike the 2D quantum Hall or quantum…
A matching is said to be disconnected if the saturated vertices induce a disconnected subgraph and induced if the saturated vertices induce a 1-regular graph. The disconnected and induced matching numbers are defined as the maximum…
Sometimes, mathematical oddities crowd in upon one another, and the exceptions to one classification scheme reveal themselves as fellow-travelers with the exceptions to a quite different taxonomy.
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…
Let $G$ be a connected graph with maximum degree $\Delta$. Brooks' theorem states that $G$ has a $\Delta$-coloring unless $G$ is a complete graph or an odd cycle. A graph $G$ is \emph{degree-choosable} if $G$ can be properly colored from…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
Isologous diversification theory for cell differentiation is proposed, based on simulations of interacting cells with biochemical networks and cell division process following consumption of some chemicals. According to the simulations of…
We describe cohomological conditions that are necessary and sufficient for the existence of balanced dualizing dg-modules, generalizing a theorem of Van den Bergh for balanced dualizing complexes over graded algebras. As a consequence, we…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
Non-discrete semigroup $T_1$-topologies on the extended bicyclic semigroup $\mathscr{C}_\mathbb{Z}$ are constructed. Also, we present topological conditions, when a semigroup (shift-continuous) $T_1$-topology on $\mathscr{C}_\mathbb{Z}$ is…
Two simple $n$-vertex graphs $G_{1}$ and $G_{2}$, with respective maximum degrees $\Delta_{1}$ and $\Delta_{2}$, are said to pack if $G_{1}$ is isomorphic to a subgraph of the complement of $G_{2}$. The BEC conjecture by Bollob\'{a}s,…
Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified by the Pearson correlation coefficient of the degree-degree…
The rules of d-separation provide a framework for deriving conditional independence facts from model structure. However, this theory only applies to simple directed graphical models. We introduce relational d-separation, a theory for…
We present a uniqueness theorem for the reduced C*-algebra of a twist $\mathcal{E}$ over a Hausdorff \'etale groupoid $\mathcal{G}$. We show that the interior $\mathcal{I}^\mathcal{E}$ of the isotropy of $\mathcal{E}$ is a twist over the…
We introduce the notion of delineation. A graph class $\mathcal C$ is said delineated if for every hereditary closure $\mathcal D$ of a subclass of $\mathcal C$, it holds that $\mathcal D$ has bounded twin-width if and only if $\mathcal D$…
The sigma index in graph theory refers to a measure of the degree differences between vertices in a graph. The goal is to determine the graphs that have the maximum sigma index within certain classes of graphs. Abdo, Dimitrov, and Gutman…
A chain of c submodules E =: E_0 >= E_1 >= ... >= E_c >= E_{c+1} := 0 gives rise to c composable 1-cocycles in Ext^1(E_{i-1}/E_i,E_i/E_{i+1}), i=1,...,c. In this paper we follow the converse question: When are c composable 1-cocycles…
We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
We prove that the bounded and bounded below derived categories of (all) modules over the dual numbers have strongly unique (dg) enhancements. To this end we relate those categories to the category of sequences of vector spaces, which allows…