SearcharxivSearch

arXiv subjects

Florian Lengyel

Publications and source records attributed to Florian Lengyel.

6 recordsLinked to original sources

Diagonal Simplicial Tensor Modules and Algebraic $n$-Hypergroupoids

Let $A$ be a commutative ring, let $k\in\mathbb{Z}^+$, and let $\vec{s}=(n_1,\dots,n_k)\in(\mathbb{Z}^+)^k$ with $n=\min_a(n_a)-1$. We attach to $\vec{s}$ a diagonal simplicial tensor module $X_\bullet(\vec{s};A)$ whose $p$-simplices are functions on a cosimplicial index set $I_p(\vec{s})\subseteq \mathbb{N}^k$. This extends Quillen's diagonal on double semi-simplicial groups: $X_\bullet(\vec{s};A)$ is obtained by restricting a $k$-fold simplicial $A$-module along the diagonal $p\mapsto(p,\ldots,p)$. Using a ``missing indices'' description of face kernels, we compute the horn kernels $R_{p,j}(X)$ and show that $R_{p,j}(X)\neq 0$ if and only if $k\ge p$, independently of $j$. Consequently, $X_\bullet(\vec{s};A)$ is an algebraic $n$-hypergroupoid in the sense of Duskin (1979) and Glenn (1982) if and only if $k\le n$, and horn fillers in dimension $n$ are non-unique if and only if $k\ge n$; in particular it is strict precisely when $k=n$. A Horn Non-Degeneracy Lemma shows that, for $p\ge 1$, $R_{p,j}(X)\cap D_p(X)=\{0\}$ and yields a decomposition $X_p=R_{p,j}(X)\oplus D_p(X)$. An explicit shift-and-truncate chain homotopy, equivariant under $\operatorname{Stab}(\vec{s})$ and compatible with a natural filtration, contracts $X_\bullet(\vec{s};A)$ and forces the associated spectral sequence to collapse at $E_1$. When $A$ is an infinite field $K$, we study simplicial submodules generated by a single tensor via kernel sequences and a moduli map to a product of Grassmannians. The moduli map image is an irreducible and unirational constructible subset of a determinantal incidence variety.

math.CO

A Cartesian Promonoidal Kernel on $Δ$ and a Hadamard Contraction of $Δ^n$

We exhibit a symmetric promonoidal kernel on the simplex category $Δ$ with Cartesian unit, yielding on representable functors a Hadamard natural transformation $Δ^p\timesΔ^q\toΔ^{pq}$ based on pointwise multiplication of nondecreasing maps. Specializing to $q=1$ yields a simplicial homotopy contracting $Δ^n$ to its $0$-vertex. The contraction is classical; the promonoidal presentation and induced Hadamard map appear not to be recorded.

math.CT

Efficient Defection: Overage-Proportional Rationing Attains the Cooperative Frontier

We study a noncooperative $n$-player game of slack allocation in which each player $j$ has entitlement $L_j>0$ and chooses a claim $C_j\ge0$. Let $v_j=(C_j-L_j)_+$ (overage) and $s_j=(L_j-C_j)_+$ (slack); set $X=\sum_j v_j$ and $I=\sum_j s_j$. At the end of the period an overage-proportional clearing rule allocates cooperative surplus $I$ to defectors in proportion to $v_j$; cooperators receive $C_j$. We show: (i) the selfish outcome reproduces the cooperative payoff vector $(L_1,\dots,L_n)$; (ii) with bounded actions, defection is a weakly dominant strategy; (iii) within the $α$-power family, the linear rule ($α=1$) is the unique boundary-continuous member; and (iv) the dominant-strategy outcome is Strong Nash under transferable utility and hence coalition-proof (Bernheim et al., 1987). We give a policy interpretation for carbon rationing with a penalty collar.

econ.TH

Denial Logic

Denial Logic DL, a system of justification logic, is the logic of an agent whose justified beliefs are false, who cannot avow his own propositional attitudes or believe tautologies, but who can believe contradictions. Using Artemov's natural semantics for justification logic JL, in which justifications are interpreted as sets of formulas, we provide an inductive construction of models of DL, and show that DL is sound and complete. Some notions developed for JL, such as constant specifications and the internalization property, are inconsistent with DL. In contrast, we define negative constant specifications, which can be used in DL to model agents with justified false beliefs. Denial logic can therefore be relevant to philosophical skepticism. We define coherent negative constant specifications for DL to model a Putnamian brain in a vat with the justified false belief that it is not a brain in a vat, and prove a "Blue Pill" theorem, which produces a model of JL in which "I am a brain in a vat" is false. We extend DL to the algebraic fibring of Denial Logic with the Logic of Proofs to model envatted brains who can justify and check tautologies and who can avow their propositional attitudes. Denial Logic was inspired by online debates over anthropogenic global warming.

math.LO

Recursion categories of coalgebras

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The category $\textbf{Set}_F$ may be embedded in the category $\mathbf{Pfn}_F$ of $F$-coalgebras and partial morphisms, which is a $P$-category that is prodominical but not dominical in general. An existence theorem of A. Heller is applied to certain subcategories of $\textbf{Pfn}_F$ to obtain examples of recursion categories of coalgebras.

math.CT