اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDefinability of Combinatorial Functions and Their Linear Recurrence Relations
129
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over $mathbb Z$ or ${mathbb Z}_m$ and allow an interpretation as counting the number of relations satisfying a property expressible in Monadic Second Order Logic (MSOL). C. Blatter and E. Specker (1981) showed that if such a function $f$ counts the number of binary relations satisfying a property expressible in MSOL then $f$ satisfies for every $m in mathbb{N}$ a linear recurrence relation over $mathbb{Z}_m$. In this paper we give a complete characterization in terms of definability in MSOL of the combinatorial functions which satisfy a linear recurrence relation over $mathbb{Z}$, and discuss various extensions and limitations of the Specker-Blatter theorem.
قيم البحث
اقرأ أيضاً
An $h$-ary relation $r$ on a finite set $A$ is said to be emph{hereditarily rigid} if the unary partial functions on $A$ that preserve $r$ are the subfunctions of the identity map or of constant maps. A family of relations ${mathcal F}$ is said to be
emph{hereditarily strongly rigid} if the partial functions on $A$ that preserve every $r in {mathcal F}$ are the subfunctions of projections or constant functions. In this paper we show that hereditarily rigid relations exist and we give a lower bound on their arities. We also prove that no finite hereditarily strongly rigid families of relations exist and we also construct an infinite hereditarily strongly rigid family of relations.
The domination polynomial D(G,x) of a graph G is the generating function of its dominating sets. We prove that D(G,x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G,x) for arbitrary graphs and for various sp
ecial cases. We give splitting formulas for D(G,x) based on articulation vertices, and more generally, on splitting sets of vertices.
We identify a canonical structure J associated to any first-order theory, the {it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple theories. J admits
a compact topology, not necessarily Hausdorff, but the Hausdorff part can already be bigger than the Kim-Pillay space. Using it, we obtain simple proofs of a number of results previously obtained using topological dynamics, but working one power set level lower. The Lascar neighbour relation is represented by a canonical relation on the compact Hausdorff part J; the general Lascar group can be read off this compact structure. This gives concrete form to results of Krupinski, Newelski, Pillay, Rzepecki and Simon, who used topological dynamics applied to large models to show the existence of compact groups mapping onto the Lascar group. In an appendix, we show that a construction analogous to the above but using infinitary patterns recovers the Ellis group of cite{kns}, and use this to sharpen the cardinality bound for their Ellis group from $beth_5$ to $beth_3$, showing the latter is optimal. There is also a close connection to another school of topological dynamics, set theory and model theory, centered around the Kechris-Pestov-Todorv cevic correspondence. We define the Ramsey property for a first order theory, and show - as a simple application of the construction applied to an auxiliary theory - that any theory admits a canonical minimal Ramsey expansion. This was envisaged and proved for certain Fraisse classes, first by Kechris-Pestov-Todorv cevic for expansions by orderings, then by Melleray, Nguyen Van The, Tsankov and Zucker for more general expansions.
We show that, for every linear ordering of $[2]^n$, there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long monotone subsequence supported on an affine cube. More generally, we
prove an analogous result for linear orderings of $[k]^n$. We show that, for every such ordering, there is a large subcube on which the ordering agrees with one of approximately $frac{(k-1)!}{2(ln 2)^k}$ orderings.
LLT polynomials are $q$-analogues of product of Schur functions that are known to be Schur-positive by Grojnowski and Haiman. However, there is no known combinatorial formula for the coefficients in the Schur expansion. Finding such a formula also pr
ovides Schur positivity of Macdonald polynomials. On the other hand, Haiman and Hugland conjectured that LLT polynomials for skew partitions lying on $k$ adjacent diagonals are $k$-Schur positive, which is much stronger than Schur positivity. In this paper, we prove the conjecture for $k=2$ by analyzing unicellular LLT polynomials. We first present a linearity theorem for unicellular LLT polynomials for $k=2$. By analyzing linear relations between LLT polynomials with known results on LLT polynomials for rectangles, we provide the $2$-Schur positivity of the unicellular LLT polynomials as well as LLT polynomials appearing in Haiman-Hugland conjecture for $k=2$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
