English
Related papers

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

200 papers

For integers $r,t\geq2$ and $n\geq1$ let $f_r(t,n)$ be the minimum, over all factorizations of the complete $r$-uniform hypergraph of order $n$ into $t$ factors $H_1,\dots,H_t$, of $\sum_{i=1}^tc(H_i)$ where $c(H_i)$ is the number of…

Combinatorics · Mathematics 2023-09-07 Paul Erdős , David P. Galvin , Fred Galvin , Michael M. Krieger

Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…

Formal Languages and Automata Theory · Computer Science 2019-02-18 James D. Currie

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

Group Theory · Mathematics 2014-02-26 Christopher J. Hillar , Lionel Levine , Darren Rhea

Let $G = {\rm U}(2m, {\mathbb F}_{q^2})$ be the finite unitary group, with $q$ the power of an odd prime $p$. We prove that the number of irreducible complex characters of $G$ with degree not divisible by $p$ and with Frobenius-Schur…

Representation Theory · Mathematics 2009-04-14 C. Ryan Vinroot

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A positive integer $n$ is said to be $2$-near perfect when $\sigma(n)=2n+d_1+d_2$, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We show that there are no odd…

Number Theory · Mathematics 2026-05-26 Richard Fearon , Henry Foushee , Benjamin Porosoff , Alexander Skula , Joshua Zelinsky , Kyle Zhang

Let $G$ denote a graph and $k\geq2$ be an integer. A $\{K_{1,1},K_{1,2},\ldots,K_{1,k},\mathcal{T}(2k+1)\}$-factor of $G$ is a spanning subgraph, whose every connected component is isomorphic to an element of…

Combinatorics · Mathematics 2024-10-10 Sizhong Zhou

In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…

Combinatorics · Mathematics 2010-04-08 Michelangelo Bucci , Alessandro De Luca , Amy Glen , Luca Q. Zamboni

Let $f$ be a Gaussian random field on $\mathbb{R}^d$ and let $X$ be the number of critical points of $f$ contained in a compact subset. A long-standing conjecture is that, under mild regularity and non-degeneracy conditions on $f$, the…

Probability · Mathematics 2023-07-21 Louis Gass , Michele Stecconi

Let \(F(z) = \prod_{k=1}^{n}(z - z_k)\) be a monic complex polynomial of degree \(n\) whose zeros satisfy \(\max\limits_{1 \le k \le n} |z_k| \le 1\). Paw{\l}owski [Trans. Amer. Math. Soc. 350(11) (1998)] considered the radius \(\gamma_n\)…

Complex Variables · Mathematics 2025-08-11 Teng Zhang

We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1.

Combinatorics · Mathematics 2013-02-12 L. Balkova , E. Pelantova

We study the hardness of approximation of clause minimum and literal minimum representations of pure Horn functions in $n$ Boolean variables. We show that unless P=NP, it is not possible to approximate in polynomial time the minimum number…

Computational Complexity · Computer Science 2014-03-12 Endre Boros , Aritanan Gruber

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

Complex Variables · Mathematics 2016-03-27 Addisalem Abathun , Rikard Bøgvad

We study the dynamics of the renormalization operator acting on the space of pairs (v,t), where v is a diffeomorphism and t belongs to [0,1], interpreted as unimodal maps x-->v(q_t(x)), where q_t(x)=-2t|x|^a+2t-1. We prove the so called…

Dynamical Systems · Mathematics 2010-01-11 Judith Cruz , Daniel Smania

An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example is the Hall-Thue word, fixed point of the morphism…

Combinatorics · Mathematics 2025-08-20 Golnaz Badkobeh , Pascal Ochem

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

Computational Complexity · Computer Science 2013-01-18 Vikraman Arvind

We study the problem of minimizing the number of critical simplices from the point of view of inapproximability and parameterized complexity. We first show inapproximability of Min-Morse Matching within a factor of…

Computational Geometry · Computer Science 2022-06-22 Ulrich Bauer , Abhishek Rathod

Two point correlation functions of the off-critical primary fields \phi_{1, 1+s} are considered in the perturbed minimal models M_{2, 2N+3} + \phi_{1,3}. They are given as infinite series of form factor contributions. The form factors of…

High Energy Physics - Theory · Physics 2008-11-26 Takeshi Oota

Using harmonic analysis on Harish-Chandra Schwartz spaces of various spherical spaces, we extend a relative local converse theorem of Youngbin Ok for the Galois model of p-adic GLn, from the class of cuspidal representations to that of…

Representation Theory · Mathematics 2025-04-14 Nadir Matringe

The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…

Representation Theory · Mathematics 2007-05-23 J. Van der Jeugt , R. B. Zhang

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

‹ Prev 1 3 4 5 6 7 10 Next ›