Related papers: No occurrence obstructions in geometric complexity…
We study closed, connected, spin 4-manifolds up to stabilisation by connected sums with copies of $S^2 \times S^2$. For a fixed fundamental group, there are primary, secondary and tertiary obstructions, which together with the signature…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…
When the vacuum Einstein equations are formulated in terms of a frame, rather than a metric, can one perturb solutions with a degenerate frame into ones with a nondegenerate frame? In examples we point out that one can encounter issues…
Hamiltonian dynamical systems tend to have infinitely many periodic orbits. For example, for a broad class of symplectic manifolds almost all levels of a proper smooth Hamiltonian carry periodic orbits. The Hamiltonian Seifert conjecture is…
We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2…
Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…
Let pi: M^{ell+n} -> B^n be a submersion that presents a regular foliation by its fibers, and let S^n subset M be a closed embedded complementary submanifold, with f = pi|S: S -> B. We give two concise obstructions to keeping S everywhere…
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
We prove a logical implication between two old conjectures stated by Bapat and Sunder about the permanent of positive semidefinite matrices. Although Drury has recently disproved both conjectures, this logical implication yields a…
One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
The existence of black holes is a central prediction of general relativity and thus serves as a basic consistency test for modified theories of gravity. In spherical symmetry, only two classes of dynamic solutions are compatible with the…
We investigate a singularly perturbed, non-convex variational problem arising in materials science with a combination of geometrical and numerical methods. Our starting point is a work by Stefan M\"uller, where it is proven that the…
Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…
Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…
The Orbit Problem asks whether the orbit of a point under a matrix reaches a given target set. When the target is a single point, the problem was shown to be decidable in polynomial time by Kannan and Lipton. This decidability result was…