Related papers: The Relation between Composability and Splittabili…

Let $F$ be a (possibly improper) edge-coloring of a graph $G$; a vertex coloring of $G$ is \emph{adapted to} $F$ if no color appears at the same time on an edge and on its two endpoints. If for some integer $k$, a graph $G$ is such that…

Let $C$ be a nonsingular projective curve over an algebraically closed field of characteristic $p>0$ and $I\subset C$ be a finite set. If $\mathcal{U}_{C,\,\omega}$ denotes the moduli space of semistable parabolic bundles of rank $r$ and…

The purpose of this paper is to prove a generalization of Faltings' connectedness theorem which asserts that, for a complete local domain R of dimension n, the punctured spectrum of R/I is connected if the ideal I is generated by at most…

We show that, given a suitable combinatorial specification for a permutation class $\mathcal{C}$, one can obtain a specification for the juxtaposition (on either side) of $\mathcal{C}$ with Av(21) or Av(12), and that if the enumeration for…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

The Robinson Splitting Theorem states that a c.e. degree $\mathbf{b}$ splits over any low c.e. degree $\mathbf{c}<\mathbf{b}$. We prove that a weaker version of this theorem holds in models of $\mathrm{P}^-+\mathrm{I}\Sigma_1$, with lowness…

Let $G$ be a locally graded group and suppose that every non-nilpotent subgroup of $G$ is permutable. We prove that $G$ is soluble. (In light of previous results of the authors, it suffices to prove that $G$ is soluble if it is periodic.

Let $M$ be a maximal subgroup of a finite group $G$ and $K/L$ be a chief factor such that $L\leq M$ while $K\nsubseteq M$. We call the group $M\cap K/L$ a $c$\ns section of $M$. And we define $Sec(M)$ to be the abstract group that is…

Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

Recently P. Wocjan and M. Horodecki [quant-ph/0503129] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent…

We study some divisibility properties of multiperfect numbers. Our main result is: if $N=p_1^{\alpha_1}... p_s^{\alpha_s} q_1^{2\beta_1}... q_t^{2\beta_t}$ with $\beta_1, ..., \beta_t$ in some finite set S satisfies…

A multiset $\Lambda=\{\lambda_1,\ldots,\lambda_n\}$ of complex numbers is said to be realizable whenever there exists a nonnegative matrix of order $n$ with spectrum $\Lambda$. One of the broadest criterion that guarantees realizability is…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

An element of a group is called $\textit{strongly reversible}$ or $\textit{strongly real}$ if it can be expressed as a product of two involutions. We provide necessary and sufficient conditions for an element of $\mathrm{SL}(n,\mathbb{C})$…

For any unitarily invariant convex function F on the states of a composite quantum system which isolates the trace there is a critical constant C such that F(w)<= C for a state w implies that w is not entangled; and for any possible D > C…

Classical results for exchangeable systems of random variables are extended to multi-class systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multi-class system, given the…

If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…

For nonnegative integers $k, d_1, \ldots, d_k$, a graph is $(d_1, \ldots, d_k)$-colorable if its vertex set can be partitioned into $k$ parts so that the $i$th part induces a graph with maximum degree at most $d_i$ for all $i\in\{1, \ldots,…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…