Related papers: Bi-Isolated d.c.e. Degrees and $\Sigma_1$ Inductio…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

The discrete KdV (dKdV) equation, the pinnacle of discrete integrability, is often thought to possess the singularity confinement property because it confines on an elementary quadrilateral. Here we investigate the singularity structure of…

Let $D=(V,A)$ be a directed graph of order $n\geq 6$. Let $W$ be a subset of $V$ with $|W|\geq 6$. Suppose that every vertex of $W$ has degree at least $(3n-3)/2$ in $D$. Then for any integer partition $|W|=n_1+n_2$ with $n_1\geq 3$ and…

We show that every thick subcategory of the singularity category of a complete intersection ring is self dual. We also prove the analogous statement for thick subcategories of the bounded derived category and give applications to the…

Let $B$ be a bilinear form on pairs of points in the complex plane, of the form $B(p,q) = p^TMq$, for an invertible $2\times2$ complex matrix $M$. We prove that any finite set $S$ contained in an irreducible algebraic curve $C$ of degree…

A graph is called odd if all of its vertex degrees are odd. A long-standing conjecture asked whether there exists a positive constant $c$ such that every $n$-vertex graph without isolated vertices contains an odd induced subgraph on at…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…

We prove: (i) if $G$ is a 1-tough graph of order $n$ and minimum degree $\delta$ with $\delta\ge(n-2)/3$ then each longest cycle in $G$ is a dominating cycle unless $G$ belongs to an easily specified class of graphs with $\kappa(G)=2$ and…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

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…

An isolating set in a graph $G$ is a set $S$ of vertices such that removing $S$ and its neighborhood leaves no edge. The isolation number $\iota(G)$ of $G$ (also known as the vertex-edge domination number) is the minimum size among all…

Distillation is the technique of training a "student" model based on examples that are labeled by a separate "teacher" model, which itself is trained on a labeled dataset. The most common explanations for why distillation "works" are…

The deautonomisation of birational maps that have the singularity confinement property, i.e. the construction of nonautonomous versions of such maps that preserve the singularity properties of the original, has proven crucial in our…

We calculate the degree of the algebra of covariants $\mathcal{C}_d$ for binary $d$-form. Also, for the degree we obtain its integral representation and asymptotic behavior.

Computer programs may go wrong due to exceptional behaviors, out-of-bound array accesses, or simply coding errors. Thus, they cannot be blindly trusted. Scientific computing programs make no exception in that respect, and even bring…

Concurrent accesses to databases are typically grouped in transactions which define units of work that should be isolated from other concurrent computations and resilient to failures. Modern databases provide different levels of isolation…

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…

Algebraic number theory relates SIC-POVMs in dimension $d>3$ to those in dimension $d(d-2)$. We define a SIC in dimension $d(d-2)$ to be aligned to a SIC in dimension $d$ if and only if the squares of the overlap phases in dimension $d$…

We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes…

We investigate degree correlations in two online social networks where users are connected through different types of links. We find that, while subnetworks in which links have a positive connotation, such as endorsement and trust, are…