Results 101 to 110 of about 2,178 (219)
Binary Matrixes Based on Pascal’s Triangle’s Arithmetics and Char Sequences
Известия Иркутского государственного университета: Серия "Математика", 2016 This work describes consisting of zeroes and ones mathematical model, binary matrix obtained by the arithmetical and combinatorial transformations of Pascal's triangle.
O. Kuzmin, B. Starkov
doaj
Topics in Cognitive Science, Volume 18, Issue 3, July 2026.Abstract Over the past several decades, research in the cognitive sciences has foregrounded the importance of active bodies and their continuous dependence on the changing environment, strengthening the relevance of dynamical models. These models have been steadily developed within the ecological psychology approach to cognition, which arguably ...
Joanna Rączaszek‐Leonardi
wiley +1 more source
From points to complexes: A concept of unexpectedness for simplicial complexes
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract In 2018, Cook, Harbourne, Migliore, and Nagel introduced the concept of unexpected hypersurfaces, which connects the study of Lefschetz properties of Artinian algebras defined by powers of linear forms to a family of interpolation problems.
Thiago Holleben
wiley +1 more source
Algorithms for Combinatorics on Words [PDF]
, 2021 V této práci je podrobně popsáno několik algoritmů řešících problémy z matematického oboru kombinatorika na slovech. Součástí práce je i jejich implementace v svobodném a otevřeném počítačovém algebraickém systému SageMath za účelem jejich integrace do ...
Martin Rejmon
core
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
Periodicity and Repetition in Combinatorics on Words [PDF]
, 2004 This thesis concerns combinatorics on words. I present many results in this area, united by the common themes of periodicity and repetition. Most of these results have already appeared in journal or conference articles. Chapter 2 -- Chapter 5 contain the
Wang, Ming-wei, Ming-wei Wang
core
International Journal of Mathematical Combinatorics, Vol.7A [PDF]
, 2013 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
Random Fibonacci Words via Clone Schur Functions
Forum of Mathematics, SigmaWe investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj +1 more source
Random Diophantine equations in the primes
Mathematika, Volume 72, Issue 3, July 2026.Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley +1 more source
Combinatorics on Words: 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings [PDF]
The set of all constant-free word equations satisfied by a given morphism is called an entire system of equations. We show that in the three-variable case, the set of nonperiodic solutions of any entire system can be described using parametric formulas ...
Saarela Aleksi
core +1 more source