Related papers: Binary intersection formalized
In this paper we prove formality of the exterior algebra on V+V* endowed with the big bracket considered as a graded Poisson algebra. We also discuss connection of this result to bialgebra deformations of the symmetric algebra of V…
It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of the most well-known translations is the Hidden…
A word is said to be bordered if it contains a nonempty proper prefix that is also a suffix. A pair of words $(u, v)$ is said to be mutually bordered if there exists a word that is a nonempty proper prefix of $u$ and suffix of $v$, and…
We use methods of the general theory of congruence and *congruence for complex matrices--regularization and cosquares-to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices…
We present a new multisymplectic framework for second-order classical field theories which is based on an extension of the unified Lagrangian-Hamiltonian formalism to these kinds of systems. This model provides a straightforward and simple…
Let $X=\C^n$. In this paper we present an algorithm that computes the de Rham cohomology groups $H^i_{dR}(U,\C)$ where $U$ is the complement of an arbitrary Zariski-closed set $Y$ in $X$. Our algorithm is a merger of the algorithm given by…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
We build on our recent work on formalization of responsibility-sensitive safety (RSS) and present the first formal framework that enables mathematical proofs of the safety of control strategies in intersection scenarios. Intersection…
To develop a full abstract denotational model of a process language based on prebisimulation preorder, its behavioural semantics has two problems: (1) Two processes related by a standard denotational interpretation afford the same finite…
In this article, we use Harrison cohomology to provide a framework for commutative deformations. In particular, Kontsevich's result that formality of (the Hochschild complex of) an associative algebra implies its deformability is adapted…
We prove an estimate for multi-variable multiplicative character sums over affine subspaces of $\mathbb A^n_k$, which generalize the well known estimates for both classical Jacobi sums and one-variable polynomial multiplicative character…
We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as objects in a global manner. In this first approach the formalism is restricted to first-order problems characterized by condensed detachment. It is…
In this paper we generalize the Ball-Collision Algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and compare the asymptotic complexity to other generalized…
We show that hyperplane sections of strongly formal manifolds inherit strong formality. In particular, this property holds for generalized complete intersections defined by positive line bundles with trivial first de Rham cohomology group.…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
The \emph{Hamming distance} $\text{ham}(u,v)$ between two equal-length words $u$, $v$ is the number of positions where $u$ and $v$ differ. The words $u$ and $v$ are said to be \emph{conjugates} if there exist non-empty words $x,y$ such that…
In 2000, A. Koldobsky asked whether two types of generalizations of the notion of an intersection-body, are in fact equivalent. The structures of these two types of generalized intersection-bodies have been studied by the author in…
Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…
We give a succinct proof of a duality theorem obtained by R\'ev\'esz in 1991 which concerns extremal quantities related to trigonomertic polynomials. The key tool of our new proof is an intersection formula on dual cones in real Banach…
We are interested in classifying groups of local biholomorphisms (or even formal diffeomorphisms) that can be endowed with a canonical structure of algebraic group up to add extra formal diffeomorphisms. We show that this is the case for…