Related papers: Forcing among exact patterns of triods
The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous patterns of…
Two cross caps in Euclidean $3$-space are said to be formally isometric if their Taylor expansions of the first fundamental forms coincide by taking a suitable local coordinate system. For a given $C^\infty$ cross cap $f$, we give a method…
We study systems of orientations on triples that satisfy the following so-called interiority condition: $\circlearrowleft(ABD)=~\circlearrowleft(BCD)=~\circlearrowleft(CAD)=1$ implies $\circlearrowleft(ABC)=1$ for any $A,B,C,D$. We call…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
The classification of elliptic curves E over the rationals Q is studied according to their torsion subgroups E_{tors}(Q) of rational points. Explicit criteria for the classification are given when E_{tors}(Q) are cyclic groups with even…
We introduce the concept of a \emph{cycle pattern} for directed graphs as functions from the set of cycles to the set $\{-,0,+\}$. The key example for such a pattern is derived from a weight function, giving rise to the sign of the total…
Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…
For an atomic domain $D$, the $elasticity$ $\rho(D)$ of $D$ is defined as $\sup\{r/s: \pi_1\cdots \pi_r = \rho_1 \cdots \rho_s,~ \text{where each $\pi_i, \rho_j$ is irreducible}\}$; the elasticity provides a concrete measure of the failure…
We survey the basics of homological algebra in exact categories in the sense of Quillen. All diagram lemmas are proved directly from the axioms, notably the five lemma, the 3 x 3-lemma and the snake lemma. We briefly discuss exact functors,…
This is a report on state-of-the-art on the question of developing higher analogues of the forcing axiom PFA. Recently there have been several attempts to develop forcing axioms analogous to the proper forcing axiom (PFA) for cardinals of…
We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…
The paper discusses stably trivial torsors for spin and orthogonal groups over smooth affine schemes over infinite perfect fields of characteristic unequal to 2. We give a complete description of all the invariants relevant for the…
The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…
Starting from a factorization theorem in Soft-Collinear Effective Theory, the thrust distribution in e+e- collisions is calculated including resummation of the next-to-next-to-next-to leading logarithms. This is a significant improvement…
We provide solutions to several problems of Foreman about ideals, several of which are closely related to Mitchell's notion of \emph{strongly proper} forcing. We prove: 1) Presaturation of a normal ideal implies projective antichain…
Exact equations are derived that relate velocity structure functions of arbitrary order with other statistics. "Exact" means that no approximations are used except that the Navier-Stokes equation and incompressibility condition are assumed…
We prove that perfect $3$-hash linear codes in $\mathbb{F}_{3}^{n}$ must have dimension at most $ \left(\frac{1}{4}-\epsilon\right)n$ for some absolute constant $\epsilon > 0$.
In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…