Results 21 to 30 of about 112 (75)
On the number of additive permutations and Skolem-type sequences [PDF]
Cavenagh and Wanless recently proved that, for sufficiently large odd n, the number of transversals in the Latin square formed from the addition table for integers modulo n is greater than (3.246)n.
Donovan, Diane, Grannell, Mike
core +1 more source
Determinacy on the edge of second‐order arithmetic, I
Abstract This is the first of two articles on the strength of m$m{}$‐Σ30$\bm{\Sigma }^0_3{}$‐determinacy for m∈N$m\in \mathbb {N}$, the strongest theories of determinacy contained in Hilbert's second‐order arithmetic (Z2)$(Z_2)$. In this article, we refute two natural conjectures on the strength of these principles in terms of inductive definability ...
J. P. Aguilera, P. D. Welch
wiley +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
A New Fixed‐Point Framework for Nonexpansive and Averaged Mappings in Normed GE‐Algebras
In this paper, we develop a systematic framework for studying fixed‐point theory in the setting of normed GE‐algebras. Building on the GE‐norm, we introduce and analyze nonexpansive mappings, α‐averaged mappings, and enriched contractions with respect to the quasimetric induced by the GE‐norm.
Prashant Patel +3 more
wiley +1 more source
Graphical abstract illustrating the challenges, opportunities, and research gaps in decarbonizing ASEAN'S transport sector through electric vehicle (EV) and biofuel policy pathways. The framework highlights infrastructural, policy, and investment barriers alongside emerging opportunities from advanced biofuel technologies and supportive policy ...
Ohn Zin Lin +4 more
wiley +1 more source
Disjoint skolem-type sequences and applications [PDF]
Let D = {i₁, i₂,..., in} be a set of n positive integers. A Skolem-type sequence of order n is a sequence of i such that every i ∈ D appears exactly twice in the sequence at position aᵢ and bᵢ, and |bᵢ - aᵢ| = i.
Alghamdi, Naeemah
core
Sets, Logic, Computation: An Open Introduction to Metalogic [PDF]
An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and
Zach, Richard
core
The flat cover conjecture for monoid acts
Abstract We prove that the Flat Cover Conjecture holds for the category of (right) acts over any right‐reversible monoid S$S$, provided that the flat S$S$‐acts are closed under stable Rees extensions. The argument shows that the class F$\mathcal {F}$‐Mono (S$S$‐act monomorphisms with flat Rees quotient) is cofibrantly generated in such categories ...
Sean Cox
wiley +1 more source
Mathematical and algorithmic methods for finding disjoint Rosa-type sequences [PDF]
A Rosa sequence of order n is a sequence S = (s1; s2; ..., s2n+1) of 2n + 1 integers satisfying the conditions: (1) for every k ∈ {1; 2;...; n} there are exactly two elements sᵢ; sj ∈ S such that si = sj = k; (2) if sᵢ = sj = k; i < j, then j - i = k ...
Alruhaymi, Fatimah
core
Finite models for positive combinatorial and exponential algebra
Abstract We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined.
Tumadhir Alsulami, Marcel Jackson
wiley +1 more source

