Results 81 to 90 of about 14,077 (306)
Consensus-halving via Theorems of Borsuk-Ulam and Tucker [PDF]
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split.
Francis Su, Forest W. Simmons
core
International Journal of Mathematical Combinatorics, Vol.2A [PDF]
, 2008 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
Cybernetics and Information Technologies, 2016 One of the strongest advantages of Distributed Evolutionary Algorithms (DEAs) is that they can be implemented in distributed environment of heterogeneous computing nodes. Usually such computing nodes differ in hardware and operating systems.
Balabanov Todor +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Composite Ti–6Al–4V–epoxy lattice structures are additively manufactured and epoxy infiltrated for cyclic loading. At low lattice volume fractions, hybridization produces synergistic gains in stiffness and energy dissipation. At higher volume fractions, synergy diminishes, although composites still exceed metallic lattices in specific energy ...
Joey Tallon +3 more
wiley +1 more source
Global Stability of Non-Solvable Ordinary Differential Equations With Applications [PDF]
, 2013 Different from the system in classical mathematics, a Smarandache system is a contradictory system in which an axiom behaves in at least two different ways within the same system, i.e., validated and invalided, or only invalided but in multiple distinct ...
Mao, Linfan, Linfan Mao
core +1 more source
Combinatorial analogs of topological zeta functions [PDF]
Discrete Mathematics, 2019 In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way that when L is the lattice of flats of a complex hyperplane arrangement we recover the usual topological zeta ...
openaire +3 more sources
Fixed Parameter Tractable Algorithms in Combinatorial Topology [PDF]
, 2014 16 pages, 9 ...
Benjamin A. Burton, William Pettersson
openaire +3 more sources
Enhancing Bubble Removal in Geometry‐Optimized Electrodes
Advanced Engineering Materials, EarlyView.3D‐printed lattice electrodes outperform stochastic foams in alkaline water electrolysis despite 20%–25% lower surface area. Straight flow channels generate Venturi‐like bubble entrainment, suppressing gas accumulation that renders foam interiors electrochemically inactive.
Florian Wiesner +5 more
wiley +1 more source
Rigidity of frameworks supported on surfaces [PDF]
, 2012 A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$.
Power, Stephen +5 more
core +1 more source
K-set agreement bounds in round-based models through combinatorial topology [PDF]
, 2020 Round-based models are the main message-passing models; combinatorial topology applied to distributed computing provide sweeping results like general lower bounds. We combine both to study the computability of k set-agreement.
Shimi, Adam +3 more
core +1 more source