Related papers: A Note on Invariant Extensions of Preorders
This document begins by reviewing recent progress that has been made by taking a combinatorial perspective on the $c_2$ invariant, an arithmetic graph invariant with connections to Feynman integrals. Then it proceeds to report on some…
We begin this note with a von Neumann algebraic version of the elementary but extremely useful fact about being able to extend inner-product preserving maps from a total set of the domain Hilbert space to an isometry defined on the entire…
In this paper, we prove some computational results about equivariant cohomology over the cyclic group $C_{p^n}$ of prime power order. We show that there is an inductive formula when the dimension of the $C_p$-fixed points of the grading is…
We prove that if $B\subseteq A$ is an extension of finite dimensional algebras such that the projective dimension of $A/B$ as a $B$-bimodule is finite, if $A$ has finite finitistic dimension, then so does $B$. We exhibit examples…
We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…
In causal models, a given mechanism is assumed to be invariant to changes of other mechanisms. While this principle has been utilized for inference in settings where the causal variables are observed, theoretical insights when the variables…
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…
We consider (self-adjoint) families of infinite matrices of noncommutative random variables such that the joint distribution of their entries is invariant under conjugation by a free quantum group. For the free orthogonal and…
We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
A premonoidal category is equipped only with a bifunctor and a natural isomorphism for associativity. We introduce a (deformation) natural automorphism representing the deviation from the Pentagon condition. We uncover a binary tree…
In the comparison of nonholonomic mechanics and constrained variational mechanics, invariant affine subbundles arise in the determination of the initial conditions where the two methods yield the same trajectories. Motivated by this,…
Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We extend our previous work from arXiv:1903.06863 on biquandle module invariants of oriented surface-links to the case of unoriented surface-links using bikei modules. The resulting infinite family of enhanced invariants proves be effective…
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
In this article, we study translations between variants of defaults logics such that the extensions of the theories that are the input and the output of the translation are in a bijective correspondence. We assume that a translation can…
We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: a query transformation approach which works by revising the preference…
It is found that Lorenz systems can be unidirectionally coupled such that the chaos expands from the drive system. This is true if the response system is not chaotic, but admits a global attractor, an equilibrium or a cycle. The extension…
The "Modularity Conjecture" is the assertion that the join of two nonmodular varieties is nonmodular. We establish the veracity of this conjecture for the case of linear idempotent varieties. We also establish analogous results concerning…