اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Searching Zimin Patterns
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In the area of pattern avoidability the central role is played by special words called Zimin patterns. The symbols of these patterns are treated as variables and the rank of the pattern is its number of variables. Zimin type of a word $x$ is introduced here as the maximum rank of a Zimin pattern matching $x$. We show how to compute Zimin type of a word on-line in linear time. Consequently we get a quadratic time, linear-space algorithm for searching Zimin patterns in words. Then we how the Zimin type of the length $n$ prefix of the infinite Fibonacci word is related to the representation of $n$ in the Fibonacci numeration system. Using this relation, we prove that Zimin types of such prefixes and Zimin patterns inside them can be found in logarithmic time. Finally, we give some bounds on the function $f(n,k)$ such that every $k$-ary word of length at least $f(n,k)$ has a factor that matches the rank $n$ Zimin pattern.
قيم البحث
اقرأ أيضاً
A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as a nonincr
easing factorization of generalized Lyndon words. We give new characterizations of the first and the last factor in this factorization as well as new characterization of generalized Lyndon words. We also give more specific results on two special cases: the classical one and the one arising from the alternating lexicographical order.
In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^omega$ and $v^omega$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon words express
ed using this infinite order. The innovative aspect of this approach is that it allows to take into account also non trivial conditions on the prefixes of a word, instead that only on the suffixes. In particular, we derive a result of Ufnarovskij [V. Ufnarovskij, Combinatorial and asymptotic methods in algebra, 1995] that characterizes a Lyndon word as a word which is greater, with respect to the infinite order, than all its prefixes. Motivated by this result, we introduce the prefix standard permutation of a Lyndon word and the corresponding (left) Cartesian tree. We prove that the left Cartesian tree is equal to the left Lyndon tree, defined by the left standard factorization of Viennot [G. Viennot, Alg`ebres de Lie libres et monoides libres, 1978]. This result is dual with respect to a theorem of Hohlweg and Reutenauer [C. Hohlweg and C. Reutenauer, Lyndon words, permutations and trees, 2003].
Bir{o} et al. (1992) introduced $H$-graphs, intersection graphs of connected subgraphs of a subdivision of a graph $H$. They are related to many classes of geometric intersection graphs, e.g., interval graphs, circular-arc graphs, split graphs, and c
hordal graphs. We negatively answer the 25-year-old question of Bir{o} et al. which asks if $H$-graphs can be recognized in polynomial time, for a fixed graph $H$. We prove that it is NP-complete if $H$ contains the diamond graph as a minor. We provide a polynomial-time algorithm recognizing $T$-graphs, for each fixed tree $T$. When $T$ is a star $S_d$ of degree $d$, we have an $O(n^{3.5})$-time algorithm. We give FPT- and XP-time algorithms solving the minimum dominating set problem on $S_d$-graphs and $H$-graphs parametrized by $d$ and the size of $H$, respectively. The algorithm for $H$-graphs adapts to an XP-time algorithm for the independent set and the independent dominating set problems on $H$-graphs. If $H$ contains the double-triangle as a minor, we prove that $H$-graphs are GI-complete and that the clique problem is APX-hard. The clique problem can be solved in polynomial time if $H$ is a cactus graph. When a graph $G$ has a Helly $H$-representation, the clique problem can be solved in polynomial time. We show that both the $k$-clique and the list $k$-coloring problems are solvable in FPT-time on $H$-graphs (parameterized by $k$ and the treewidth of $H$). In fact, these results apply to classes of graphs with treewidth bounded by a function of the clique number. We observe that $H$-graphs have at most $n^{O(|H|)}$ minimal separators which allows us to apply the meta-algorithmic framework of Fomin et al. (2015) to show that for each fixed $t$, finding a maximum induced subgraph of treewidth $t$ can be done in polynomial time. When $H$ is a cactus, we improve the bound to $O(|H|n^2)$.
The hypercontractive inequality is a fundamental result in analysis, with many applications throughout discrete mathematics, theoretical computer science, combinatorics and more. So far, variants of this inequality have been proved mainly for product
spaces, which raises the question of whether analogous results hold over non-product domains. We consider the symmetric group, $S_n$, one of the most basic non-product domains, and establish hypercontractive inequalities on it. Our inequalities are most effective for the class of emph{global functions} on $S_n$, which are functions whose $2$-norm remains small when restricting $O(1)$ coordinates of the input, and assert that low-degree, global functions have small $q$-norms, for $q>2$. As applications, we show: 1. An analog of the level-$d$ inequality on the hypercube, asserting that the mass of a global function on low-degrees is very small. We also show how to use this inequality to bound the size of global, product-free sets in the alternating group $A_n$. 2. Isoperimetric inequalities on the transposition Cayley graph of $S_n$ for global functions, that are analogous to the KKL theorem and to the small-set expansion property in the Boolean hypercube. 3. Hypercontractive inequalities on the multi-slice, and stabili
We exhibit a weakly aperiodic tile set for Baumslag-Solitar groups, and prove that the domino problem is undecidable on these groups. A consequence of our construction is the existence of an arecursive tile set on Baumslag-Solitar groups.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
