English
Related papers

Related papers: Alphabets, rewriting trails and periodic represent…

200 papers

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

Combinatorics · Mathematics 2026-05-28 Yutong Zhang , Yaoran Yang

Maximal independent set (MIS), maximal matching (MM), and $(\Delta+1)$-coloring in graphs of maximum degree $\Delta$ are among the most prominent algorithmic graph theory problems. They are all solvable by a simple linear-time greedy…

Data Structures and Algorithms · Computer Science 2020-06-16 Sepehr Assadi , Shay Solomon

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

Number Theory · Mathematics 2019-05-30 Shuichi Otake , Tony Shaska

We study sequences $(x_n)_{n=1}^{\infty}$ of reals given by $x_{n+1} = f(x)$ where $$f(x) = x - \sum_{i=1}^{m} \frac{\alpha_i}{x - \beta_i},$$ where $\alpha_1, \dots, \alpha_m \in \mathbb{R}_{>0}$ and $\beta_1, \dots, \beta_m \in…

Dynamical Systems · Mathematics 2024-01-09 Stefan Steinerberger

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski

We investigate the structure and reconstruction complexity of Manacher arrays. First, we establish a combinatorial lower bound, proving that the number of rooted tandem repeat trees with $n+1$ genes exceeds the number of distinct Manacher…

Data Structures and Algorithms · Computer Science 2025-07-21 Michael Itzhaki

Let $\beta>1$ be a non-integer. First we show that Lebesgue almost every number has a $\beta$-expansion of a given frequency if and only if Lebesgue almost every number has infinitely many $\beta$-expansions of the same given frequency.…

Dynamical Systems · Mathematics 2019-10-09 Yao-Qiang Li

For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…

Functional Analysis · Mathematics 2025-12-19 Kevin Beanland , Hung Viet Chu , Thomas Schlumprecht , András Zsák

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

Data Structures and Algorithms · Computer Science 2019-02-08 Gábor Ivanyos , Youming Qiao

Let $\beta >1$ be an integer or generally a Pisot number. Put $T(x) = \{ \beta x \}$ on $[0,1]$ and let $S: [0,1]\to [0,1]$ be a piecewise linear transformation whose slopes have the form $\pm \beta^m$ with positive integers $m$. We give…

Dynamical Systems · Mathematics 2020-11-04 Shigeki Akiyama , Hajime Kaneko , Dong Han Kim

We investigate matching for the family $T_\alpha(x) = \beta x + \alpha \pmod 1$, $\alpha \in [0,1]$, for fixed $\beta > 1$. Matching refers to the property that there is an $n \in \mathbb N$ such that $T_\alpha^n(0) = T_\alpha^n(1)$. We…

Dynamical Systems · Mathematics 2016-10-07 Henk Bruin , Carlo Carminati , Charlene Kalle

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…

Combinatorics · Mathematics 2022-04-20 Jacob Fox , Zoe Himwich , Nitya Mani

We investigate bounds for the multiplicities $m(\beta+i\gamma)$, where $\beta+i\gamma\,$ ($\beta\ge \1/2, \gamma>0)$ denotes complex zeros of $\zeta(s)$. It is seen that the problem can be reduced to the estimation of the integrals of the…

Number Theory · Mathematics 2017-06-27 Aleksandar Ivić

We study sublinear time algorithms for estimating the size of maximum matching in graphs. Our main result is a $(\frac{1}{2}+\Omega(1))$-approximation algorithm which can be implemented in $O(n^{1+\epsilon})$ time, where $n$ is the number…

Data Structures and Algorithms · Computer Science 2022-06-28 Soheil Behnezhad , Mohammad Roghani , Aviad Rubinstein , Amin Saberi

In the first part of the paper we answer (positively) a question raised by the first author which has to do with some sort of rigity of the tail of resolution of an ideal. Let $I$ be a homogeneous ideal in a polynomial ring over a field of…

Commutative Algebra · Mathematics 2007-05-23 Aldo Conca , Juergen Herzog , Takayuki Hibi

Let $T$ be an algebraic automorphism of $\mathbb{T}^{m}$ having the following property: the characteristic polynomial of its matrix is irreducible over $\mathbb{Q}$, and a Pisot number $\beta$ is one of its roots. We define the mapping…

Dynamical Systems · Mathematics 2007-05-23 Nikita Sidorov

This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…

Formal Languages and Automata Theory · Computer Science 2013-05-30 Shigeki Akiyama , Victor Marsault , Jacques Sakarovitch

Let $K$ be the function field of a smooth, irreducible curve defined over $\overline{\mathbb{Q}}$. Let $f\in K[x]$ be of the form $f(x)=x^q+c$ where $q = p^{r}, r \ge 1,$ is a power of the prime number $p$, and let $\beta\in \overline{K}$.…

Number Theory · Mathematics 2021-08-12 Andrew Bridy , John R. Doyle , Dragos Ghioca , Liang-Chung Hsia , Thomas J. Tucker

In this paper we study the expansions of real numbers in positive and negative real base as introduced by R\'enyi, and Ito & Sadahiro, respectively. In particular, we compare the sets $\mathbb{Z}_\beta^+$ and $\mathbb{Z}_{-\beta}$ of…

Combinatorics · Mathematics 2014-02-19 Daniel Dombek , Zuzana Masáková , Tomáš Vávra

We examine the noncommutative minimal model program for orders on arithmetic surfaces, or equivalently, arithmetic surfaces enriched by a Brauer class $\beta$. When $\beta$ has prime index $p>5$, we show the classical theory extends with…

Algebraic Geometry · Mathematics 2021-08-09 Daniel Chan , Colin Ingalls
‹ Prev 1 3 4 5 6 7 10 Next ›