English
Related papers

Related papers: Normal cyclic polytopes and cyclic polytopes that …

200 papers

Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…

Combinatorics · Mathematics 2022-06-16 Maya Sankar

We study the constant $\mathscr{C}_{d,p}$ defined as the smallest constant $C$ such that $\|P\|_\infty^p \leq C\|P\|_p^p$ holds for every polynomial $P$ of degree $d$, where we consider the $L^p$ norm on the unit circle. We conjecture that…

Complex Variables · Mathematics 2026-05-14 Sarah May Instanes

It was shown recently that associated with a pair of real sequences $\{\{c_{n}\}_{n=1}^{\infty}, \{d_{n}\}_{n=1}^{\infty}\}$, with $\{d_{n}\}_{n=1}^{\infty}$ a positive chain sequence, there exists a unique nontrivial probability measure…

Classical Analysis and ODEs · Mathematics 2016-08-30 Cleonice F. Bracciali , Jairo S. Silva , A. Sri Ranga , Daniel O. Veronese

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova

In the paper, the authors find the greatest value $\lambda$ and the least value $\mu $ such that the double inequality \begin{multline*} C(\lambda a+(1-\lambda)b,\lambda b+(1-\lambda )a)<\alpha A(a,b)+(1-\alpha)T(a,b)\\ < C(\mu…

Classical Analysis and ODEs · Mathematics 2016-06-30 Wei-Dong Jiang , Feng Qi

In this paper we study $N_d(k)$ the smallest positive integer such that any nice measure $\mu$ in $\R^d$ can be partitioned in $N_d(k)$ parts of equal measure so that every hyperplane avoids at least $k$ of them. A theorem of Yao and Yao…

Metric Geometry · Mathematics 2021-06-09 Edgardo Roldán-Pensado , Pablo Soberón

Given a graph $G$, let $\tau_1(G)$ denote the smallest size of a set of edges whose deletion makes $G$ triangle-free, and let $\alpha_1(G)$ denote the largest size of an edge set containing at most one edge from each triangle of $G$.…

Combinatorics · Mathematics 2018-05-08 Gregory J. Puleo

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…

Combinatorics · Mathematics 2016-09-14 Arnau Padrol

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

Combinatorics · Mathematics 2013-09-02 Isidoro Gitler , Carlos E. Valencia

We present an algorithm to find an integral vector in the polyhedral cone $\Gamma=\{X | \textbf{A}X \leq \textbf{0}\}$, without assuming the explicit knowledge of $\textbf{A}$. About the polyhedral cone, $\Gamma$, it is only given that, (i)…

Optimization and Control · Mathematics 2011-11-15 Ali Kakhbod , Morteza Zadimoghaddam

Given a family $\mathcal{B}$ of axis-parallel boxes in $\mathbb{R}^d$, let $\tau$ denote its piercing number, and $\nu$ its independence number. It is an old question whether $\tau/\nu$ can be arbitrarily large for given $d\geq 2$. Here,…

Combinatorics · Mathematics 2022-10-12 István Tomon

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

High Energy Physics - Theory · Physics 2011-01-17 Amihay Hanany , Rak-Kyeong Seong

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…

Combinatorics · Mathematics 2024-05-14 Kristina Oganesyan

The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B…

Combinatorics · Mathematics 2011-06-30 Jørgen Bang-Jensen , Matthias Kriesell , Alessandro Maddaloni , Sven Simonsen

We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…

Information Theory · Computer Science 2019-11-22 Yun Fan , Hualu Liu

We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$…

Combinatorics · Mathematics 2020-05-15 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $\theta_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $\theta_1$ is…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger , Chih-wen Weng

Let $d$ be a positive integer. Let $p$ be a prime number. Let $\alpha$ be a real algebraic number of degree $d+1$. We establish that there exist a positive constant $c$ and infinitely many algebraic numbers $\xi$ of degree $d$ such that…

Number Theory · Mathematics 2015-05-13 Yann Bugeaud , Bernard De Mathan

In this paper we consider polytopes given by systems of $n$ inequalities in $d$ variables, where every inequality has at most two variables with nonzero coefficient. We denote this family by $LI(2)$. We show that despite of the easy…

Computational Complexity · Computer Science 2017-07-03 Komei Fukuda , May Szedlak

Let $\Gamma$ be a chain of cycles of genus $g$. Let $d$,$r$ be integers with $1 \leq r \leq g-2$ and $2r\leq d \leq g-3+r$. Then $w^r_d(\Gamma)=d-2r$ implies $\Gamma$ is hyperelliptic. For each $g \geq 2r+3$ there exist non-hyperelliptic…

Combinatorics · Mathematics 2025-05-01 Marc Coppens