English
Related papers

Related papers: A partial answer to the Demyanov-Ryabova conjectur…

200 papers

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

For a polynomial differential system $$\dot{x}=-y+\sum\limits_{i+j=3}\alpha_{i,j}x^iy^j,\quad \dot{y}=x+\sum\limits_{i+j=3}\beta_{i,j}x^iy^j,$$ Pleshkan (Differ. Equations, 1969) proved that the origin is an isochronous center of this…

Dynamical Systems · Mathematics 2025-03-13 Jihua Yang , Qipeng Zhang

We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…

Metric Geometry · Mathematics 2007-05-23 Günter M. Ziegler

In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…

Combinatorics · Mathematics 2020-04-21 Lei Xue

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

Let $G$ be a connected, simply-connected, and almost simple algebraic group, and let $\sigma$ be a Dynkin automorphism on $G$. In this paper, we get a bijection between the set of $\st$-invariant MV cycles (polytopes) for $G$ and the set of…

Representation Theory · Mathematics 2019-07-19 Jiuzu Hong

Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…

Complex Variables · Mathematics 2015-03-17 Dmitry Khavinson , Rajesh Pereira , Mihai Putinar , Edward B. Saff , Serguei Shimorin

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

Combinatorics · Mathematics 2012-06-11 Mark Mixer , Egon Schulte , Asia Ivic Weiss

Let $\pi: X \to Y$ be a morphism of projective varieties and suppose that $\alpha$ is a pseudo-effective numerical cycle class satisfying $\pi_*\alpha = 0$. A conjecture of Debarre, Jiang, and Voisin predicts that $\alpha$ is a limit of…

Algebraic Geometry · Mathematics 2017-05-17 Mihai Fulger , Brian Lehmann

We classify all Kutasov-Seiberg type dualities in large $N_c$ SQCD with adjoints of rational $R$-charges. This is done by equating the superconformal index of the electric and magnetic theories: the obtained equation has a solution each…

High Energy Physics - Theory · Physics 2019-07-24 Borut Bajc

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

Combinatorics · Mathematics 2015-03-13 Tetsushi Matsui , Akihiro Higashitani , Yuuki Nagazawa , Hidefumi Ohsugi , Takayuki Hibi

We consider the problem of characterizing solutions in $(x, y)$ to the equation ${x \choose y}={{x-a} \choose {y+b}}$ in terms of $a$ and $b$. We obtain one simple result which allows the determination of a ratio in terms of $a$ and $b$…

Number Theory · Mathematics 2014-11-18 Hugo Jenkins

A new family of non-degenerate involutive set-theoretic solutions of the Yang-Baxter equation is constructed. All these solutions are strong twisted unions of multipermutation solutions of multipermutation level at most two. A large…

Group Theory · Mathematics 2016-10-06 David Bachiller , Ferran Cedo , Eric Jespers , Jan Okninski

We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…

Group Theory · Mathematics 2026-04-02 Ryan McCulloch , Lee Tae Young

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

Combinatorics · Mathematics 2024-12-18 Aldo Kiem , Olaf Parczyk , Christoph Spiegel

The present paper is devoted to the study of the maximum number of limit cycles bifurcated from the periodic orbits of the quadratic isochronous center $\dot{x}=-y+\frac{16}{3}x^{2}-\frac{4}{3}y^{2},\dot{y}=x+\frac{8}{3}xy$ by the averaging…

Classical Analysis and ODEs · Mathematics 2016-09-27 Xiuli Cen , Shimin Li , Yulin Zhao

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

Metric Geometry · Mathematics 2009-01-06 Zhiqiang Xu

In this paper we extend three results about polycycles (also known as graphs) of planar smooth vector field to planar non-smooth vector fields (also known as piecewise vector fields, or Filippov systems). The polycycles considered here may…

Dynamical Systems · Mathematics 2024-05-08 Paulo Santana

A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that any diameter-2-critical graph of order n has at most…

Combinatorics · Mathematics 2026-04-17 Antoine Dailly , Florent Foucaud , Adriana Hansberg

One of the aims of this article is to provide a class of polynomial mappings for which the Jacobian conjecture is true. Also, we state and prove several global univalence theorems and present a couple of applications of them.

Complex Variables · Mathematics 2017-06-01 Saminathan Ponnusamy , Victor V. Starkov