Related papers: Failure on n-uniqueness: a family of examples
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
For $r \geq 2$, we show that every maximal $K_{r+1}$-free graph $G$ on $n$ vertices with $(1-\frac{1}{r})\frac{n^2}{2}-o(n^{\frac{r+1}{r}})$ edges contains a complete $r$-partite subgraph on $(1 - o(1))n$ vertices. We also show that this is…
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…
Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…
A second order finite-difference equation has two linearly independent solutions. It is shown here that, like in the continuous case, at most one of the two can be a polynomial solution. The uniqueness in the classical continuous…
We construct classes of ${\cal N}=1$ superconformal theories elements of which are labeled by punctured Riemann surfaces. Degenerations of the surfaces correspond, in some cases, to weak coupling limits. Different classes are labeled by two…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
A stability analysis is made for a non-singular pre-big-bang like cosmological model based on 1-loop corrected string effective action. Its homogeneous and isotropic solution realizes non-singular transition from de Sitter universe to…
We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…
Answering a question of Goode, we show that $k$-triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
We show that for any $n\geq 3$ the theory of open generalized $n$-gons is complete, decidable and strictly stable, yielding a new class of examples in the zoo of stable theories.
In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…
We give a positive answer to a conjecture of Berestycki and Lions in 1983 on the uniqueness of bound states to $\Delta u +f(u)=0$ in $\mathbb{R}^n$, $u\in H^1(\mathbb{R}^n)$, $u\not\equiv 0$, $n\ge 3$. For the model nonlinearity…
It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…
The stable roommates problem is a non-bipartite version of the well-known stable matching problem. Teo and Sethuraman proved that, for each instance of the stable roommates problem in a complete graph, there exists a linear inequality…
We denote the number of distinct topologies which can be defined on a set $X$ with $n$ elements by $T(n)$. Similarly, $T_0(n)$ denotes the number of distinct $T_0$ topologies on the set $X$. In the present paper, we prove that for any prime…
The purpose of this paper has twofold. The first is to prove a unicity theorem for meromorphic mappings of a complete K\"{a}hler manifold M in P^n(C) sharing few hypersurfaces. The second is to give a unicity theorem for the case of…
A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…
In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…