English
Related papers

Related papers: Bounds on some edge Folkman numbers

200 papers

In this paper, we obtain order estimates for the Gelfand widths of intersections of finite-dimensional balls under some conditions on parameters.

Functional Analysis · Mathematics 2024-12-16 A. A. Vasil'eva

We present new bounds for the Berezin number inequalities which improve on the existing bounds. We also obtain bounds for the Berezin norm of operators as well as the sum of two operators.

Functional Analysis · Mathematics 2022-02-09 Pintu Bhunia , Anirban Sen , Kallol Paul

In this paper, we introduce the notion of F-manifold color algebras and study their properties which extend some results for F-manifold algebras.

Rings and Algebras · Mathematics 2021-01-13 Ming Ding , Zhiqi Chen , Jifu Li

We construct relatively bounded toroidal and toric models of relatively bounded fibrations over curves.

Algebraic Geometry · Mathematics 2026-03-06 Caucher Birkar

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

Combinatorics · Mathematics 2009-05-06 Sergi Elizalde

We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.

Analysis of PDEs · Mathematics 2024-02-21 Francesco Esposito , Berardino Sciunzi , Nicola Soave

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Information Theory · Computer Science 2007-07-13 Beniamin Mounits , Tuvi Etzion , Simon Litsyn

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

Combinatorics · Mathematics 2009-09-25 Denis Krotov , Sergey Avgustinovich

For a graph $G$ the expression $G \overset{v}{\rightarrow} (a_1, ..., a_s)$ means that for every $s$-coloring of the vertices of $G$ there exists $i \in \{1, ..., s\}$ such that there is a monochromatic $a_i$-clique of color $i$. The vertex…

Combinatorics · Mathematics 2019-03-28 Aleksandar Bikov , Nedyalko Nenov

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

Number Theory · Mathematics 2020-07-31 I. E. Shparlinski , C. L. Stewart

The boundary problem is considered for inhomogeneous increasing random walks on the square lattice ${\mathbb Z}_+^2$ with weighted edges. Explicit solutions are given for some instances related to the classical and generalized number…

Probability · Mathematics 2009-09-29 Alexander Gnedin

We investigate several boundedness properties of function spaces considered as uniform spaces.

General Topology · Mathematics 2018-02-19 Lubica Hola , Ljubisa D. R. Kocinac

We obtain upper bounds on the number of singular points of factorial terminal Fano threefolds.

Algebraic Geometry · Mathematics 2017-08-02 Yu. Prokhorov

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

Commutative Algebra · Mathematics 2018-04-30 A. V. Jayanthan , N. Narayanan , B. V. Raghavendra Rao

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

Commutative Algebra · Mathematics 2017-09-25 Faryal Chaudhry , Rida Irfan

An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.

Numerical Analysis · Mathematics 2025-10-20 Nenad Ujevic

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

Combinatorics · Mathematics 2015-03-31 Hong Wang , Ben Yang , Ruixiang Zhang

We determine the additional structure which arises on the classical limit of a DQ-algebroid.

Quantum Algebra · Mathematics 2019-02-20 Paul Bressler , Alexander Gorokhovsky , Ryszard Nest , Boris Tsygan

In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of…

Combinatorics · Mathematics 2021-06-07 Nikita Dubinin Andreevich

New upper and lower bounds on the Castelnuovo-Mumford regularity are given in terms of the Hilbert coefficients. Examples are provided to show that these bounds are in some sense nearly sharp.

Commutative Algebra · Mathematics 2018-09-21 Le Xuan Dung , Le Tuan Hoa
‹ Prev 1 3 4 5 6 7 10 Next ›