Results 11 to 20 of about 4,003 (147)
The Asymptotic Number of Binary Codes and Binary Matroids [PDF]
12 ...
Marcel Wild
openaire +5 more sources
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]‐decorated containers
Abstract We use the hypergraph container theory of Balogh–Morris–Samotij and Saxton–Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies closed under certain families of projections. We give a number of applications of our results, including a multicolour generalisation of a theorem of Hatami, Janson and ...
Victor Falgas‐Ravry +3 more
wiley +1 more source
Associahedra for finite‐type cluster algebras and minimal relations between g‐vectors
Abstract We show that the mesh mutations are the minimal relations among the g${\bm{g}}$‐vectors with respect to any initial seed in any finite‐type cluster algebra. We then use this algebraic result to derive geometric properties of the g${\bm{g}}$‐vector fan: we show that the space of all its polytopal realizations is a simplicial cone, and we then ...
Arnau Padrol +3 more
wiley +1 more source
Research trends in combinatorial optimization
Abstract Real‐world problems are becoming highly complex and therefore have to be solved with combinatorial optimization (CO) techniques. Motivated by the strong increase in publications on CO, 8393 articles from this research field are subjected to a bibliometric analysis.
Jann Michael Weinand +4 more
wiley +1 more source
Walrasian equilibria from an optimization perspective: A guide to the literature
Abstract An ideal market mechanism allocates resources efficiently such that welfare is maximized and sets prices in a way so that the outcome is in a competitive equilibrium and no participant wants to deviate. An important part of the literature discusses Walrasian equilibria and conditions for their existence.
Martin Bichler +2 more
wiley +1 more source
ClusterSets: Optimizing Planar Clusters in Categorical Point Data
Abstract In geographic data analysis, one is often given point data of different categories (such as facilities of a university categorized by department). Drawing upon recent research on set visualization, we want to visualize category membership by connecting points of the same category with visual links.
J. Geiger +7 more
wiley +1 more source
Generalized m‐Polar Fuzzy Positive Implicative Ideals of BCK‐Algebras
This study focuses on combining the theories of m‐polar fuzzy sets over BCK‐algebras and establishing a new framework of m‐polar fuzzy BCK‐algebras. In this paper, we define the idea of m‐polar fuzzy positive implicative ideals in BCK‐algebras and investigate some related properties.
Anas Al-Masarwah +4 more
wiley +1 more source
Modeling Complex Systems by Structural Invariants Approach
When modeling complex systems, we usually encounter the following difficulties: partiality, large amount of data, and uncertainty of conclusions. It can be said that none of the known approaches solves these difficulties perfectly, especially in cases where we expect emergences in the complex system.
Jiri Bila +3 more
wiley +1 more source
Let \(M=(E,{\mathcal F})\) be a matroid on the underlying set E (\({\mathcal F}\) is the collection of flats of M). A simple matroid \(A=(S,{\mathcal T})\) is the adjoint of M if \(r_ M(E)=r_ A(S)\) and there exists an injection \(\phi\) : \({\mathcal F}\to {\mathcal T}\) such that for \(F_ 1,F_ 2\in {\mathcal F}\), if \(F_ 1\subseteq F_ 2\) then ...
Bixby, Robert E., Coullard, Collette R.
openaire +1 more source
Graphic and Cographic Г-Extensions of Binary Matroids
Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-extension operation on binary matroids is a generalization of the point-addition operation. In general, under the Г-extension operation the properties like
Borse Y.M., Mundhe Ganesh
doaj +1 more source

