English
Related papers

Related papers: A note on a recent attempt to solve the second par…

200 papers

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

Combinatorics · Mathematics 2019-10-23 Rajko Nenadov , Mehtaab Sawhney , Benny Sudakov , Adam Zsolt Wagner

Let $F$ be a field of characteristic not $2$ with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over $F$.…

Number Theory · Mathematics 2024-05-03 Detlev Hoffmann , Nico Lorenz

In this paper we study the maximum number $N$ of limit cycles that can exhibit a planar piecewise linear differential system formed by two pieces separated by a straight line. More precisely, we prove that this maximum number satisfies…

Dynamical Systems · Mathematics 2021-01-29 Rodrigo D. Euzébio , Jaume Llibre

In this paper, we characterize arbitrary polynomial vector fields on $S^n$. We establish a necessary and sufficient condition for a degree one vector field on the odd-dimensional sphere $S^{2n-1}$ to be Hamiltonian. Additionally, we…

Dynamical Systems · Mathematics 2024-12-04 Supriyo Jana , Soumen Sarkar

Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…

Metric Geometry · Mathematics 2024-04-02 Andrii Arman , Andriy Bondarenko , Andriy Prymak

This short note studies the asymptotic behavior of a generating function associated with the decimal expansion of \(2^n\). Our aims are twofold: (i) to present a problem on the best possible upper bound for this behavior, and (ii) to…

Combinatorics · Mathematics 2025-10-22 Hideaki Noda

For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…

Combinatorics · Mathematics 2024-02-21 Sayan Mukherjee

Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

Discrete Mathematics · Computer Science 2017-05-02 Syed Mohammad Meesum

A graph is outerplanar if it has a planar drawing for which all vertices belong to the outer face of the drawing. Let $H$ be a graph. The outerplanar Tur\'an number of $H$, denoted by $ex_\mathcal{OP}(n,H)$, is the maximum number of edges…

Combinatorics · Mathematics 2023-10-03 Ervin Győri , Guilherme Zeus Dantas e Moura , Runtian Zhou

Feldman and Karlin conjectured that the number of isolated fixed points for deterministic models of viability selection and recombination among n possible haplotypes has an upper bound of 2^n - 1. Here a proof is provided. The upper bound…

Populations and Evolution · Quantitative Biology 2013-02-04 Lee Altenberg

We derive semiclassical asymptotics for the orthogonal polynomials P_n(z) on the line with respect to the exponential weight \exp(-NV(z)), where V(z) is a double-well quartic polynomial, in the limit when n, N \to \infty. We assume that…

Mathematical Physics · Physics 2016-09-07 Pavel Bleher , Alexander Its

In this paper, we construct two classes of planar polynomial Hamiltonian systems having a center at the origin, and obtain the lower bounds for the number of critical periods for these systems. For polynomial potential systems of degree…

Dynamical Systems · Mathematics 2020-05-06 Xiuli Cen

We show that smooth solutions to the Euler equation on the half-plane can exhibit double-exponential growth of their vorticity gradients. We also determine the maximal possible growth rate and construct solutions that saturate it. These are…

Analysis of PDEs · Mathematics 2025-10-01 Andrej Zlatos

The issue of so-called maximal regularity is discussed within a Hilbert space framework for a class of evolutionary equations. Viewing evolutionary equations as a sums of two unbounded operators, showing maximal regularity amounts to…

Analysis of PDEs · Mathematics 2016-04-05 Rainer Picard , Sascha Trostorff , Marcus Waurick

We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…

Combinatorics · Mathematics 2025-06-13 On-Hei Solomon Lo , Carol T. Zamfirescu

We show that Hilbert's Tenth Problem is undecidable for complementary subrings of number fields and that the p-adic and archimedean ring versions of Mazur's conjectures do not hold in these rings. More specifically, given a number field K,…

Logic · Mathematics 2011-09-14 Kirsten Eisentraeger , Graham Everest , Alexandra Shlapentokh

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

We prove two results regarding cycles in properly edge-colored graphs. First, we make a small improvement to the recent breakthrough work of Alon, Pokrovskiy and Sudakov who showed that every properly edge-colored complete graph $G$ on $n$…

Combinatorics · Mathematics 2017-06-16 Jozsef Balogh , Theodore Molla
‹ Prev 1 8 9 10 Next ›