English
Related papers

Related papers: Geometrical aspects of expansions in complex bases

200 papers

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

This note focuses on the problem of representing convex sets as projections of the cone of positive semidefinite matrices, in the particular case of sets generated by bivariate polynomials of degree four. Conditions are given for the convex…

Optimization and Control · Mathematics 2008-09-22 Didier Henrion

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

Optimization and Control · Mathematics 2010-07-27 João Gouveia , Rekha R. Thomas

Let $\pi$ be a finite dimensional unitary representation of a group $G$ with a generating symmetric $n$-element set $S\subset G$. Fix $\vp>0$. Assume that the spectrum of $|S|^{-1}\sum_{s\in S} \pi(s) \otimes \overline{\pi(s)}$ is included…

Operator Algebras · Mathematics 2023-04-12 Gilles Pisier

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

Combinatorics · Mathematics 2007-05-23 Amitava Bhattacharya , Shmuel Friedland , Uri N. Peled

Using elementary duality properties of positive semidefinite moment matrices and polynomial sum-of-squares decompositions, we prove that the convex hull of rationally parameterized algebraic varieties is semidefinite representable (that is,…

Optimization and Control · Mathematics 2011-01-31 Didier Henrion

Let $\pi$ be a unitary automorphic cuspidal representation of $GL_2(\mathbb{Q}_\mathbb{A})$ with Fourier coefficients $\lambda_\pi(n)$. Asymptotic expansions of certain sums of $\lambda_\pi(n)$ are proved using known functorial liftings…

Number Theory · Mathematics 2015-10-06 Huixue Lao , Mark McKee , Yangbo Ye

A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…

Number Theory · Mathematics 2017-05-16 Anant Godbole , Zach Higgins , Zoe Koch

We provide a complete characterisation of extreme points of the space of sofic representations. We also show that the restriction map $Sof(G,P^{\omega})$ to $Sof(H,P^{\omega})$, where $H\subset G$ is not always surjective. The first part of…

Dynamical Systems · Mathematics 2019-02-20 Liviu Paunescu

We study the topology of the set X of the solutions of a system of two quadratic inequalities in the real projective space RP^n (e.g. X is the intersection of two real quadrics). We give explicit formulae for its Betti numbers and for those…

Algebraic Geometry · Mathematics 2012-09-07 Antonio Lerario

Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properties of a suitable edge-coloured and vertex-weighted oriented…

Combinatorics · Mathematics 2016-10-05 M. Brunetti , A. D'Aniello

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Probability · Mathematics 2019-08-13 Gilles Bonnet , Eliza O'Reilly

The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…

Combinatorics · Mathematics 2018-04-06 Thao Do

We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…

Number Theory · Mathematics 2014-09-03 Igor Szczyrba , Rafal Szczyrba , Martin Burtscher

Sidorov and Vershik showed that in base $G=\frac{\sqrt{5}+1}{2}$ and with the digits $0,1$ the numbers $x=nG ~(\text {mod} 1)$ have $\aleph_{0}$ expansions for any $n\in\mathbb{Z}$, while the other elements of $(0, \frac{1}{G-1})$ have…

Number Theory · Mathematics 2015-04-08 Yuehua Ge , Bo Tan

For a region $\Omega \subset\mathbb{C}$ denote by $\Psi(Q;\Omega)$ the number of complex algebraic numbers in $\Omega$ of degree $\leq n$ and naive height $\leq Q$. We show that $$…

Number Theory · Mathematics 2016-03-18 Friedrich Götze , Dzianis Kaliada , Dmitry Zaporozhets

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

Combinatorics · Mathematics 2011-08-02 Adam N. Letchford , Hanna Seitz , Dirk Oliver Theis

If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Rolf Schneider

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…

Data Structures and Algorithms · Computer Science 2008-12-11 Jérôme Leroux