English
Related papers

Related papers: Counting the Palstars

200 papers

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…

Combinatorics · Mathematics 2007-05-23 Jacques Verstraete

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Number Theory · Mathematics 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form…

Combinatorics · Mathematics 2021-08-11 Torsten Mütze , Jerri Nummenpalo , Bartosz Walczak

We show that the permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first show a more general identity involving \alpha-permanents:…

Combinatorics · Mathematics 2013-04-08 Harry Crane

A sequence of real numbers $\{x_{n}\}_{n\in \mathbb{N}}$ is said to be $\alpha \beta$-statistically convergent of order $\gamma$ (where $0<\gamma\leq 1$) to a real number $x$ \cite{a} if for every $\delta>0,$ $$\underset{n\rightarrow…

Probability · Mathematics 2016-05-23 Pratulananda Das , Sanjoy Ghosal , Vatan Karakaya , Sumit Som

The prefix palindromic length $PPL_u(n)$ of an infinite word $u$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $u$. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that…

Discrete Mathematics · Computer Science 2020-01-09 Anna E. Frid

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Combinatorics · Mathematics 2015-03-19 Andrew Suk

Given a convex disk $K$ and a positive integer $k$, let $\delta_T^k(K)$ and $\delta_L^k(K)$ denote the $k$-fold translative packing density and the $k$-fold lattice packing density of $K$, respectively. Let $T$ be a triangle. In a very…

Metric Geometry · Mathematics 2016-01-19 Kirati Sriamorn

Let $a$ and $b$ be positive integers with prime factorisations $a = p_1^np_2^n$ and $b = q_1^nq_2^n$. We prove that the number of essentially distinct $\alpha$-graceful labelings of the complete bipartite graph $K_{a, b}$ equals the…

Combinatorics · Mathematics 2023-08-24 Nikolai Beluhov

It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.

Combinatorics · Mathematics 2009-12-02 Janusz Adamus

A multiplicative $\alpha$-spanner $H$ is a subgraph of $G=(V,E)$ with the same vertices and fewer edges that preserves distances up to the factor $\alpha$, i.e., $d_H(u,v)\leq\alpha\cdot d_G(u,v)$ for all vertices $u$, $v$. While many…

Data Structures and Algorithms · Computer Science 2021-07-06 Markus Chimani , Finn Stutzenstein

Real-valued triplet of scalar fields as source gives rise to a metric which tilts the scalar, not the light cone, in 2+1-dimensions. The topological metric is static, regular and it is characterized by an integer $\kappa =\pm 1,\pm 2,...$.…

General Physics · Physics 2015-06-09 S. Habib Mazharimousavi , M. Halilsoy

Based on a closed formula for a star product of Wick type on $\CP^n$, which has been discovered in an earlier article of the authors, we explicitly construct a subalgebra of the formal star-algebra (with coefficients contained in the…

q-alg · Mathematics 2009-10-28 M. Bordemann , M. Brischle , C. Emmrich , S. Waldmann

We show that the number of all maximal $\alpha$-gapped repeats and palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and $7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.

Formal Languages and Automata Theory · Computer Science 2018-03-01 Tomohiro I , Dominik Köppl

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

The $2$-layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, however, the fundamental class of $k$-planar graphs has been…

Discrete Mathematics · Computer Science 2020-08-24 Patrizio Angelini , Giordano Da Lozzo , Henry Förster , Thomas Schneck

We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We…

Data Structures and Algorithms · Computer Science 2016-10-12 Amihood Amir , Alberto Apostolico , Travis Gagie , Gad M. Landau

For $-\pi\leq\beta_1<\beta_2\leq\pi$ denote by $\Phi_{\beta_1,\beta_2}(Q)$ the number of algebraic numbers on the unit circle with arguments in $[\beta_1,\beta_2]$ of degree $2m$ and with elliptic height at most $Q$. We show that \[…

Number Theory · Mathematics 2021-01-28 Friedrich Götze , Anna Gusakova , Zakhar Kabluchko , Dmitry Zaporozhets

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Number Theory · Mathematics 2010-06-29 Siu-lun Alan Lee