Results 101 to 110 of about 37,501 (244)

A Practical Guide to First‐Principles Calculations for Pseudocapacitive Materials: From Electrochemical Experiments to Atomistic Understanding

open access: yesChemElectroChem, Volume 13, Issue 20, 16 October 2026.
Electrochemical experiments reveal what happens, whereas first principles calculations explain why. Emerging computational electrochemistry is bridging these perspectives, enabling quantitative understanding of electrode/electrolyte interfaces and enabling the rational design of next‐generation energy storage materials.
Kenji Oqmhula, Ryo Maezono, Kenta Hongo
wiley   +1 more source

Combinatorics [PDF]

open access: yes, 2014
Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...

core   +2 more sources

The Turań Number of 2P7

open access: yesDiscussiones Mathematicae Graph Theory, 2019
The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj   +1 more source

Combinatorics on ideals and axiom A [PDF]

open access: yesJournal of Symbolic Logic, 1994
Throughout this paper denotes a nonprincipal ultrafilter and ℐ denotes the dual ideal. ℙ(ℐ) is the poset of all partial functions p: ω → 2 such that dom(p) ∈ ℐ. In [2], Grigorieff proved that ω1 is preserved in the corresponding generic extension if and only if is a P-point.
openaire   +4 more sources

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real‐World Data

open access: yesAdvanced Intelligent Discovery, Volume 2, Issue 5, October 2026.
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley   +1 more source

Utterance evolution: the road to generative, combinatorial communicators

open access: yesBiological 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

Algebraic Capsets

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 10, Page 459-463, October 2026.
ABSTRACT Capsets are subsets of F 3 n with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3. In particular we construct the smallest known complete capsets with size proportional to the best known lower bound.
Cassie Grace, José Felipe Voloch
wiley   +1 more source

Analysis of Rainbow Vertex Antimagic Coloring and its Application to Cryptographic Secret Sharing with Affine Cipher Technique

open access: yesJTAM (Jurnal Teori dan Aplikasi Matematika)
Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik   +5 more
doaj   +1 more source

Conflict-Free Vertex-Connections of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy