Related papers: Words with factor complexity $2n+1$ and minimal cr…

We study the number of $0,1$-words where the fraction of 0 is "almost" fixed for any initial subword. It turns out that this study use and reveal the structure of the Galois group (the monodromy group) of the polynomials $(x+1)^n-\lambda…

This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining…

We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

It is well known that the set of values of a lower central word in a group $G$ need not be a subgroup. For a fixed lower central word $\gamma_r$ and for $p\ge 5$, Guralnick showed that if $G$ is a finite $p$-group such that the verbal…

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…

The complete analysis of a model with three quartic coupling constants associated with an O(2N)--symmetric, a cubic, and a tetragonal interactions is carried out within the three-loop approximation of the renormalization-group (RG) approach…

A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil…

A spanning subgraph of a graph G is called a [0,2]-factor of G, if for . is a union of some disjoint cycles, paths and isolate vertices, that span the graph G. It is easy to get a [0,2]-factor of G and there would be many of [0,2]-factors…

The toughness of a graph $G$ is defined as the minimum value of $|S|/c(G-S)$ over all cutsets $S$ of $G$ if $G$ is noncomplete, and is defined to be $\infty$ if $G$ is complete. For a real number $t$, we say that $G$ is $t$-tough if its…

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Rote words are infinite words that contain $2n$ factors of length $n$ for every $n \geq 1$. Shallit and Shur, as well as Ollinger and Shallit, showed that there are Rote words that avoid $(5/2)^+$-powers and that this is best possible. In…

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas…

We study minimum cost constraint satisfaction problems (MinCostCSP) through the algebraic lens. We show that for any constraint language $\Gamma$ which has the dual discriminator operation as a polymorphism, there exists a…

In this paper, we provide a new characterization of uniformly recurrent words with finite defect based on a relation between the palindromic and factor complexity. Furthermore, we introduce a class of morphisms P_ret closed under…

In this paper, we are concerned with sufficient conditions for the existence of a $\{P_{2},P_{2k+1}\}$-factor. We prove that for $k\geq 3$, there exists $\varepsilon_{k}>0$ such that if a graph $G$ satisfies $\sum_{0\leq j\leq…

In this note, starting with any group homomorphism $f\colon\Gamma\to G$, which is surjective upon abelianization, we construct a universal central extension $u\colon U\twoheadrightarrow G,$ UNDER $\Gamma$ with the same surjective property,…

A transversal set of a graph $G$ is a set of vertices incident to all edges of $G$. The transversal number of $G$, denoted by $\tau(G)$, is the minimum cardinality of a transversal set of $G$. A simple graph $G$ with no isolated vertex is…

In this paper, we are concerned with the following type of elliptic problems: $$ (-\Delta)^{\alpha} u+a(x) u=\frac{|u|^{2^*_{s}-2}u}{|x|^s}+k(x)|u|^{q-2}u, u\,\in\,H^\alpha({\mathbb R}^N), $$ where $2<q< 2^*$, $0<\alpha<1$, $0<s<2\alpha$,…