Results 61 to 70 of about 70,377,857 (147)

Unexpected Primes of Good Reduction in Quotients of Modular and Shimura Curves

open access: yesMathematische Nachrichten, EarlyView.
ABSTRACT We find all zero‐dimensional spaces of newforms of weight 2 and squarefree level N$N$ with a fixed Atkin–Lehner sign pattern. As an application, we classify unexpected primes of good reduction of Atkin–Lehner quotients of modular and Shimura curves of squarefree levels.
Oana Padurariu   +2 more
wiley   +1 more source

Combinatorics, Words and Symbolic Dynamics

open access: yes, 2016
Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics. They explain the important concepts, providing a clear exposition of some recent results, and emphasise ...

core   +1 more source

On an Algorithm for Multiperiodic Words

open access: yesActa Polytechnica, 2013
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet.
Štepán Holub
doaj  

Forbidden intersection problems for families of linear maps

open access: yesDiscrete Analysis, 2023
Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj   +1 more source

On the Contribution of WORDS to the Field of Combinatorics on Words [PDF]

open access: yes, 2015
We propose some notes about the history and the features of the conference WORDS, our goal being to testify how the conference may be embedded in the development of the field of Combinatorics on Words.
openaire   +3 more sources

Against All Odds?—A Surprisingly Not So Easy Dice Game

open access: yesTeaching Statistics, EarlyView.
ABSTRACT A game with 11 players, 2 dice, and simple rules. However, it turns out that the best strategy is not only absent from the literature, but that misconceptions about winning strategies also prevail among surveyed students. This makes it all the more surprising that it is not so easy to get to the bottom of the game mathematically.
Christoph Oberbucher   +1 more
wiley   +1 more source

Shuffle Product Formulas and Combinatorial Identities

open access: yesMathematics
We study shuffle product structures on words in three letters, extending the classical framework of multiple zeta values. Using an evaluation map that relates admissible words to iterated integrals, we translate shuffle identities into combinatorial ...
Kwang-Wu Chen
doaj   +1 more source

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

open access: yesComputer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

International Journal of Mathematical Combinatorics, Vol.3 [PDF]

open access: yes, 2009
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

On the Limits of Intransitive Coordination

open access: yesRatio, EarlyView.
ABSTRACT A growing number of authors suggest that concept coordination—the kind of relation we pick out when we say that the concepts of one or more individuals represent something as the same—is not a transitive relation. Here we consider global features of representational systems to break new ground in the assessment of the intransitivity view. From
Víctor M. Verdejo, Joost J. Joosten
wiley   +1 more source

Home - About - Disclaimer - Privacy