Related papers: Failure on n-uniqueness: a family of examples

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

We generalize Hrushovski's group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically stable types, which we recall in…

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of…

We provide a universal characterization of the construction taking a scheme $X$ to its stable $\infty$-category $\text{Mot}(X)$ of noncommutative motives, patterned after the universal characterization of algebraic K-theory due to…

In the present work, we consider a variety of two-component, one-dimensional states in nonlinear Schrodinger equations in the presence of a parabolic trap, inspired by the atomic physics context of Bose-Einstein condensates. The use of…

First, we systemize ealier results the uniform persistence for discrete model $A_{n+1}=A_nF(A_{n-m})$ of population growth, where $F:(0,\infty)\to(0,\infty)$ is continuous and strictly decreasing. Second, we investigation the effect of…

We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…

We study some static multi-soliton configurations in the su(N + 1) Toda models. Such configurations exist for N > 1. We construct explicitly a multi-soliton solution for any N and study conditions for having such solutions. The number of…

We explain how structures analogous to those appearing in the theory of stability conditions on abelian and triangulated categories arise in geometric invariant theory. This leads to an axiomatic notion of a central charge on a scheme with…

Let F be a non-archimedean local field of characteristic zero. We consider distributions on GL(n+1,F) which are invariant under the adjoint action of GL(n,F). We prove that any such distribution is invariant with respect to transposition.…

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…

The multiple futile cycle is a phosphorylation system in which a molecular substrate might be phosphorylated sequentially n times by means of an enzymatic mechanism. The system has been studied mathematically using reaction network theory…

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

For any $n<\omega$ we construct an infinite Heyting algebra $H_n$ which is $(n+1)$-generated but that contains only finite $n$-generated subalgebras. From this we conclude that for every $n<\omega$ there exists a variety of Heyting algebras…