Results 71 to 80 of about 2,178 (219)

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

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

Combinatorics, Automata and Number Theory [PDF]

open access: yes, 2010
editorial reviewedThis collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory.

core   +1 more source

The implications of generative artificial intelligence for mathematics education

open access: yesSchool Science and Mathematics, EarlyView.
Abstract Generative artificial intelligence has become prevalent in discussions of educational technology, particularly in the context of mathematics education. These AI models can engage in human‐like conversation and generate answers to complex questions in real‐time, with education reports accentuating their potential to make teachers' work more ...
Candace Walkington
wiley   +1 more source

On the automorphisms of the power semigroups of a numerical semigroup

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley   +1 more source

Bounded exponential sums with multiplicative coefficients

open access: yesMathematika, Volume 72, Issue 4, October 2026.
Abstract We investigate when the exponential sum Sf(x,α):=∑n⩽xf(n)e(nα)$S_f(x,\alpha) := \sum _{n\leqslant x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function f$f$ and α∈R$\alpha \in \mathbb {R}$. We show that under natural assumptions, Sf(x,α)$S_f(x,\alpha)$ is bounded only when f$f$ is very close to a twisted Dirichlet character χ(n ...
Péa Bazin, Ihor Pylaiev, Fred Tyrrell
wiley   +1 more source

Abelian number fields with frobenian conditions

open access: yesMathematika, Volume 72, Issue 4, October 2026.
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley   +1 more source

Combinatorics on Words 10th International Conference [PDF]

open access: yes, 2015
This volume contains the Local Proceedings of the Tenth International Conference on WORDS, that took place at the Kiel University, Germany, from the 14th to the 17th September 2015.

core  

Simple juntas for shifted families

open access: yesDiscrete Analysis, 2020
**For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp.
Peter Frankl, Andrey Kupavskii
doaj   +1 more source

On Tight Tree‐Complete Hypergraph Ramsey Numbers

open access: yesJournal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.
ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley   +1 more source

Home - About - Disclaimer - Privacy