Related papers: Isolated d.c.e. degrees and $\Sigma_1$ induction

The goal of this article is to initiate a discussion on what it takes to claim "there is no new physics at the weak scale," namely that the Standard Model (SM) is "isolated." The lack of discovery of beyond the SM (BSM) physics suggests…

A torsion theory is called differential (higher differential) if a derivation (higher derivation) can be extended from any module to the module of quotients corresponding to the torsion theory. We study conditions equivalent to higher…

It is proposed that (i) the temperature dependence of the superconducting gap Delta(T) in high-Tc cuprates can be predicted just from the knowledge of Delta(0) and the critical temperature Tc; and, in particular, (ii) Delta(0)/Tc > 4…

An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the…

This paper focuses on the prevalent performance imbalance in the stages of incremental learning. To avoid obvious stage learning bottlenecks, we propose a brand-new stage-isolation based incremental learning framework, which leverages a…

We use discrete Morse theory to give a new proof of the Degree Theorem in Auter space A_n. There is a filtration of A_n into subspaces A_{n,k} using the degree of a graph, and the Degree Theorem says that each A_{n,k} is (k-1)-connected.…

Let $\mathcal{A}$ be an abelian length category containing a $d$-cluster tilting subcategory $\mathcal{M}$. We prove that a subcategory of $\mathcal{M}$ is a $d$-torsion class if and only if it is closed under $d$-extensions and…

We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13$ and $d\ge 1$, we give first explicit constructions of…

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,…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

In this paper, we consider the edge disjoint caterpillar realizations of tree degree sequences. We give the necessary and sufficient conditions when two tree degree sequences have edge disjoint caterpillar realizations. We conjecture that…

Let $G$ be a graph. A subset $D \subseteq V(G)$ is called a 1-isolating set of $G$ if $\Delta(G-N[D]) \leq 1$, that is, $G-N[D]$ consists of isolated edges and isolated vertices only. The $1$-isolation number of $G$, denoted by…

We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpillar realizations. By using a probabilistic method, we prove…

A retract variety is defined as a class of algebras closed under isomorphisms, retracts and products. Let a principal retract variety be generated by one algebra and a set-principal retract variety be generated by some set of algebras. It…

A natural experiment is a type of observational study in which treatment assignment, though not randomized by the investigator, is plausibly close to random. A process that assigns treatments in a highly nonrandom, inequitable manner may,…

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…

A set $D$ of vertices in a graph $G=(V,E)$ is a degree restricted dominating set for $G$ if each vertex $v_i$ in $D$ is dominating atmost $g(d_i)$ vertices of $V-D$, where $g$ is a function restricting the degree value $d_i$ with respect to…

We introduce Dagma-DCE, an interpretable and model-agnostic scheme for differentiable causal discovery. Current non- or over-parametric methods in differentiable causal discovery use opaque proxies of ``independence'' to justify the…

In recent years, researchers have discovered various large algebraic structures that have surprising finiteness properties, such as FI-modules and Delta-modules. In this paper, we add another example to the growing list: we show that…

We consider dc-conductivity $\sigma$ of a mixture of small conducting and insulating grains slightly below the percolation threshold, where finite clusters of conducting grains are characterized by a wide spectrum of sizes. The charge…