Results 81 to 90 of about 70,151 (171)

Polyominoes determined by permutations [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti   +4 more
doaj   +1 more source

Combinatorial Applications of the Subspace Theorem

open access: yes, 2013
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and the ...
Schwartz, Ryan, Solymosi, Jozsef
core   +1 more source

Elucidating the Physical and Mathematical Properties of the Prouhet‐Thue‐Morse Sequence in Quantum Computing

open access: yesAnnalen der Physik, Volume 538, Issue 4, April 2026.
The Prouhet‐Thue‐Morse (PTM) sequence emerges as a unifying thread across quantum error correction, noise‐resistant memories, spin‐chain dynamics, quantum chaos, and Dirichlet links to the Riemann zeta function. Mapping PTM‐encoded logical states onto qubit and qudit architectures uncovers symmetry‐protected resilience and multifractal signatures ...
Denis Janković   +3 more
wiley   +1 more source

Topical Bias in Generalist Mathematics Journals [PDF]

open access: yes, 2010
Generalist mathematics journals exhibit bias toward the branches of mathematics by publishing articles about some subjects in quantities far disproportionate to the production of papers in those areas within all of mathematics.Comment: 8 pages, 3 ...
Grcar, Joseph F.
core  

Recursive and Cyclic Constructions for Double‐Change Covering Designs

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 4, Page 198-209, April 2026.
ABSTRACT A double‐change covering design (DCCD) is a v‐set V and an ordered list L of b blocks of size k where every pair from V must occur in at least one block and each pair of consecutive blocks differs by exactly two elements. It is minimal if it has the fewest blocks possible and circular when the first and last blocks also differ by two elements.
Amanda Lynn Chafee, Brett Stevens
wiley   +1 more source

Subsquares in Random Latin Squares and Rectangles

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 4, Page 184-197, April 2026.
ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux   +3 more
wiley   +1 more source

Tessellation Groups, Harmonic Analysis on Non‐Compact Symmetric Spaces and the Heat Kernel in View of Cartan Convolutional Neural networks

open access: yesFortschritte der Physik, Volume 74, Issue 4, April 2026.
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré   +4 more
wiley   +1 more source

Noncommutative polygonal cluster algebras

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 4, April 2026.
Abstract We define a new family of noncommutative generalizations of cluster algebras called polygonal cluster algebras. These algebras generalize the noncommutative surfaces of Berenstein–Retakh, and are inspired by the emerging theory of Θ$\Theta$‐positivity for the groups Spin(p,q)$\mathrm{Spin}(p,q)$.
Zachary Greenberg   +3 more
wiley   +1 more source

Natural realizations of sparsity matroids [PDF]

open access: yes, 2010
A hypergraph G with n vertices and m hyperedges with d endpoints each is (k,l)-sparse if for all sub-hypergraphs G' on n' vertices and m' edges, m'\le kn'-l.
Streinu, Ileana, Theran, Louis
core   +2 more sources

Integer colorings with forbidden rainbow sums

open access: yes, 2020
For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which ...
Cheng, Yangyang   +4 more
core  

Home - About - Disclaimer - Privacy