Results 131 to 140 of about 23,253 (274)
ABSTRACT Purity is the principle that fundamental facts only have fundamental constituents. In recent years, it has played a significant (if sometimes implicit) role in metaphysical theorizing. A philosopher will argue that a fact [p]$[p]$ contains a derivative entity and cite Purity as a reason to deny that [p]$[p]$ is fundamental. I argue that recent
Samuel Z. Elgin
wiley +1 more source
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
Recursions for distribution functions and stop-loss transforms. [PDF]
For any functions on the non-negative integers, we can evaluate the cumulative function given by (s) = sx=o(x) from the values of by the recursion (s) = (s - 1) + (s).
Sundt, B, Dhaene, Jan, Willmot, GE
core
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source
Hidden zeros and 2-split via BCFW recursion relation
In this paper, we provide another angle to understand recent discoveries, i.e., the hidden zeros and corresponding 2-split behavior using the BCFW recursion relation. For the hidden zeros, we show that although the BCFW recursion relation is not directly
Bo Feng, Liang Zhang, Kang Zhou
doaj +1 more source
Enhancing Learning of Recursion
Recursion is one of the most important and hardest topics in lower division computer science courses. As it is an advanced programming skill, the best way to learn it is through targeted practice exercises.
Hamouda, Sally
core
Abstract Active learning (AL) has emerged as a pedagogical response to diverse educational challenges across multiple disciplines. This scoping review maps the terrain of AL implementation patterns, examining AL practices in Business Education, Information and Communication Technology (ICT) Engineering, Mathematics, and Statistics from 2015 until the ...
Dubravka Novkovic +2 more
wiley +1 more source

