Results 121 to 130 of about 144,275 (215)
Exactness and the topology of the space of invariant random equivalence relations
Abstract We characterize exactness of a countable group Γ$\Gamma$ in terms of invariant random equivalence relations (IREs) on Γ$\Gamma$. Specifically, we show that Γ$\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.
Héctor Jardón‐Sánchez +3 more
wiley +1 more source
Cutting Planes in Combinatorics
The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial ...
openaire +2 more sources
Penalty method for unilateral contact problem with Coulomb's friction in time-fractional derivatives
The purpose of this work is to study a mathematical model that describes a contact between a deformable body and a rigid foundation. A linear viscoelastic Kelvin-Voigt constitutive law with time-fractional derivatives describes the material’s behavior ...
Essafi Lakbir, Bouallala Mustapha
doaj +1 more source
Note on extremal problems about connected subgraph sums. [PDF]
Cambie S, Groenland C.
europepmc +1 more source
Photography Did Not Kill Painting: On Artificial Intelligence and the Future of Academic Medicine. [PDF]
Kim JW.
europepmc +1 more source
Combinatorics and complexity of chimpanzee (Pan troglodytes) facial signals. [PDF]
Florkiewicz BN, Lazebnik T.
europepmc +1 more source
Can geometric combinatorics improve RNA branching predictions? [PDF]
Poznanović S, Cardwell O, Heitsch C.
europepmc +1 more source
Quantum higher-order Fourier analysis and the Clifford hierarchy. [PDF]
Bu K, Gu W, Jaffe A.
europepmc +1 more source
Counting Rankings of Tree-Child Networks. [PDF]
Zhang Q, Steel M.
europepmc +1 more source

