Related papers: Modular Construction of Fixed Point Combinators an…
Large language models (LLMs) have significantly advanced formal theorem proving, yet the scarcity of high-quality training data constrains their capabilities in complex mathematical domains. Combinatorics, a cornerstone of mathematics,…
This work investigates the framework and performance issues of the composite neural network, which is composed of a collection of pre-trained and non-instantiated neural network models connected as a rooted directed acyclic graph for…
Peter Aczel has given a categorical construction for fixed points of normal functors, i.e. dilators which preserve initial segments. For a general dilator $X\mapsto T_X$ we cannot expect to obtain a well-founded fixed point, as the order…
$\beta(1,0)$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $\beta(1,0)$-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In…
We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
Composite Pulses (CPs) are widely used in Nuclear Magnetic Resonance (NMR), optical spectroscopy, optimal control experiments and quantum computing to manipulate systems that are well-described by a two-level Hamiltonian. A careful design…
A partial combinatory algebra (PCA) is a set equipped with a partial binary operation that models a notion of computability. This paper studies a generalization of PCAs, introduced by W. Stekelenburg, where a PCA is not a set but an object…
We consider q-state Potts models coupled by their energy operators. Restricting our study to self-dual couplings, numerical simulations demonstrate the existence of non-trivial fixed points for 2 <= q <= 4. These fixed points were first…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
Basic matrices are defined which provide unique building blocks for the class of normal matrices which include the classes of unitary and Hermitian matrices. Unique builders for quantum logic gates are hence derived since a quantum logic…
In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…
We consider a new type of mappings in metric spaces which can be characterized as mappings contracting perimeters of triangles. It is shown that such mappings are continuous. The fixed-point theorem for such mappings is proved and the…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
The polar coordinate transformation (PCT) method has been extensively used to treat various singular integrals in the boundary element method (BEM). However, the resultant integrands of the PCT tend to become nearly singular when (1) the…
We introduce two novel complementary notions of the Lefschetz number for a functor from a finite acyclic category to itself and we prove a Lefschetz fixed-object theorem and a Lefschetz fixed-morphism theorem. In order to do so, we use the…
We conjecture a simple set of "Feynman rules" for constructing $n$-point global conformal blocks in any channel in $d$ spacetime dimensions, for external and exchanged scalar operators for arbitrary $n$ and $d$. The vertex factors are given…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics…