English
Related papers

Related papers: A note on the combination of equilibrium problems

200 papers

A note on the property of weak contraction, which implies that all bounded solutions of a nonlinear system converge to a (possibly non-unique) equilibrium. We provide some simple results about interconnections of such systems, and a brief…

Optimization and Control · Mathematics 2015-10-13 Ian R. Manchester , Jean-Jacques E. Slotine

In this paper, we propose new algorithms for finding a common point of the solution set of a pseudomonotone equilibrium problem and the set of fixed points of a symmetric generalized hybrid mapping in a real Hilbert space. The convergence…

Optimization and Control · Mathematics 2015-08-18 Bui Van Dinh , Do Sang Kim

In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from…

Optimization and Control · Mathematics 2015-10-28 Dang Van Hieu

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…

Combinatorics · Mathematics 2017-11-16 Martina Juhnke-Kubitzke , Lorenzo Venturello

A notion of balanced pairs in an extriangulated category with a negative first extension is defined in this article. We prove that there exists a bijective correspondence between balanced pairs and proper classes $\xi$ with enough…

Representation Theory · Mathematics 2021-09-06 Jian He , Panyue Zhou

Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…

Optimization and Control · Mathematics 2025-02-11 Oday Hazaimah

Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games…

Computational Complexity · Computer Science 2008-02-21 Mihalis Yannakakis

The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…

Combinatorics · Mathematics 2019-06-11 József Balogh , Shagnik Das , Hong Liu , Maryam Sharifzadeh , Tuan Tran

Group classification of a class of nonlinear fin equations is carried out exhaustively. Additional equivalence transformations and conditional equivalence groups are also found. They allow to simplify results of classification and further…

Mathematical Physics · Physics 2008-11-18 O. O. Vaneeva , A. G. Johnpillai , R. O. Popovych , C. Sophocleous

We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound…

Combinatorics · Mathematics 2024-04-03 Ilya D. Shkredov

We introduce the following generalization of set intersection via characteristic vectors: for $n,q,s, t \ge 1$ a family $\mathcal{F}\subseteq \{0,1,\dots,q\}^n$ of vectors is said to be \emph{$s$-sum $t$-intersecting} if for any distinct…

Combinatorics · Mathematics 2023-05-03 Balázs Patkós , Zsolt Tuza , Máté Vizer

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a…

Combinatorics · Mathematics 2018-09-25 Luka Milićević

This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…

Functional Analysis · Mathematics 2014-03-17 Ibrahim Karahan , Murat Ozdemir

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

Logic · Mathematics 2016-07-13 Christian Herrmann , Yasuyuki Tsukamoto , Martin Ziegler

In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…

Number Theory · Mathematics 2012-08-15 Shalom Eliahou , Cedric Lecouvey

For a well-posed non-selfadjoint indefinite second-order linear elliptic PDE with general coefficients $\mathbf A, \mathbf b,\gamma$ in $L^\infty$ and symmetric and uniformly positive definite coefficient matrix $\mathbf A$, this paper…

Numerical Analysis · Mathematics 2022-03-10 C. Carstensen , Neela Nataraj , Amiya K. Pani

An interplay between the sum of certain series related to Harmonic numbers and certain finite trigonometric sums is investigated. This allows us to express the sum of these series in terms of the considered trigonometric sums, and permits…

Classical Analysis and ODEs · Mathematics 2017-01-09 Omran Kouba

A family F is intersecting if any two members have a nonempty intersection. Erdos, Ko, and Rado showed that |F|\leq {n-1\choose k-1} holds for an intersecting family of k-subsets of [n]:={1,2,3,...,n}, n\geq 2k. For n> 2k the only extremal…

Combinatorics · Mathematics 2011-08-11 Peter Frankl , Zoltan Furedi
‹ Prev 1 8 9 10 Next ›