Results 31 to 40 of about 165,985,528 (155)
Fundamentals of Partially Ordered Sets [PDF]
, 1968 Gives the basic definitions and theorems of similar partially ordered sets; studies finite partially ordered sets, including the problem of combinatorial analysis; and includes the ideas of complete, dense, and continuous partially ordered sets ...
Compton, Lewis W.
core
Aggregation operators on partially ordered sets and their categorical foundations [PDF]
, 2006 summary:In spite of increasing studies and investigations in the field of aggregation operators, there are two fundamental problems remaining unsolved: aggregation of $L$-fuzzy set-theoretic notions and their justification.
Demirci, Mustafa
core +1 more source
Linear Versus Centred Colouring via Pseudogrids
Journal of Graph Theory, Volume 113, Issue 3, Page 448-461, November 2026.ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique.
Prosenjit Bose +4 more
wiley +1 more source
, 1959 summary:Some modifications of the definition of density of subsets in ordered (= partially ordered) sets are given and the corresponding concepts are ...
Vránová, Lidmila +3 more
core +1 more source
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, Volume 101, Issue 5, Page 2427-2447, October 2026.ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +1 more source
A Notion of Convergence in Fuzzy Partially Ordered Sets
, 2020 The notion of sequential convergence in fuzzy partially ordered sets, under the name oF-convergence, is well known. Our aim in this paper is to introduce and study a notion of net convergence, with respect to the fuzzy order relation, named o-convergence,
Dimitrios Georgiou +2 more
core +1 more source
International Journal of Mathematical Combinatorics, Vol.3A [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Graphical partially ordered sets [PDF]
, 1987 In this paper we study graphical partially ordered sets (GPO-sets) and their properties. Principal applications of the theory of GPO-sets concern graphs, diagraphs, hypergraphs, etc.
Borzacchini, L.
core +1 more source
Bounded exponential sums with multiplicative coefficients
Mathematika, Volume 72, Issue 4, October 2026.Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
wiley +1 more source