Results 81 to 90 of about 73,359 (215)

Avoidability of formulas with two variables

, 2016
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ of variables if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism.
A Thue, AI Zimin, DR Bean, G Badkobeh, KA Baker, M Lothaire, P Ochem, P Ochem   +7 more
core   +4 more sources

Counting Independent Sets in Percolated Graphs via the Ising Model

Random Structures &Algorithms, Volume 68, Issue 1, January 2026.
ABSTRACT Given a graph G$$ G $$, we form a random subgraph Gp$$ {G}_p $$ by including each edge of G$$ G $$ independently with probability p$$ p $$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite graphs satisfying certain vertex‐isoperimetric properties, extending the work of ...
Anna Geisler, Mihyun Kang, Michail Sarantis, Ronen Wdowinski   +3 more
wiley   +1 more source

Global solver based on the Sperner lemma and Mazurkewicz–Knaster‐Kuratowski–lemma based proof of the Brouwer fixed‐point theorem

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, Volume 106, Issue 1, January 2026.
Abstract In this paper a fixed‐point solver for mappings from a simplex into itself that is gradient‐free, global and requires d$d$ function evaluations for halving the error is presented, where d$d$ is the dimension. It is based on topological arguments and uses the constructive proof of the Mazurkewicz–Knaster–Kuratowski lemma when used as part of ...
Thilo Moshagen
wiley   +1 more source

Sintagmatics vs. Combinatorics: Basic Principles of Combinatorial Linguistics

Научный диалог, 2017
The article is devoted to syntagmatics and combinatorics that form the basis of combinatorial linguistics or science of language which studies linear relations of language units and their combinatorial potential.
M. V. Vlavatskaya
doaj  

The Necessary Uniformity of Physical Probability

Philosophy and Phenomenological Research, Volume 112, Issue 1, Page 290-306, January 2026.
ABSTRACT According to contemporary consensus, physical probabilities may be “non‐uniform”: they need not correspond to a uniform measure over the space of physically possible worlds. Against consensus, I argue that only uniform probabilities connect robustly to long‐run frequencies.
Ezra Rubenstein
wiley   +1 more source

Plank theorems and their applications: A survey

Bulletin of the London Mathematical Society, Volume 58, Issue 1, January 2026.
Abstract Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems in various areas of mathematics.
William Verreault
wiley   +1 more source

Properties of Pseudo-Primitive Words and their Applications [PDF]

, 2010
A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t).
Kari, Lila, Masson, Benoît, Seki, Shinnosuke   +2 more
core   +1 more source

Continuity properties of the lower spectral radius

, 2014
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set.
Bochi, Jairo, Morris, Ian D.
core   +1 more source

The story of sunflowers

Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.
Abstract Sunflowers, or Δ$\Delta$‐systems, are a fundamental concept in combinatorics introduced by Erdős and Rado in their paper: [J. London Math. Soc. (1) 35 (1960), 85–90]. A sunflower is a collection of sets where all pairs have the same intersection.
Anup Rao
wiley   +1 more source