English
Related papers

Related papers: Efficient simplicial replacement of semi-algebraic…

200 papers

Consider a classical elliptic pseudodifferential operator $P$ on ${\Bbb R}^n$ of order $2a$ ($0<a<1)$ with even symbol. For example, $P=A(x,D)^a$ where $A(x,D)$ is a second-order strongly elliptic differential operator; the fractional…

Analysis of PDEs · Mathematics 2016-04-25 Gerd Grubb

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded…

Commutative Algebra · Mathematics 2021-03-10 Jackson Autry , Paige Graves , Jessie Loucks , Christopher O'Neill , Vadim Ponomarenko , Samuel Yih

We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$ generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We show how to construct (and compute parameters) for the dual code of any evaluation code…

Information Theory · Computer Science 2008-07-14 C. Galindo , F. Monserrat

By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…

Combinatorics · Mathematics 2012-02-28 Leonardo Manuel Cabrer

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

Computational Complexity · Computer Science 2013-04-30 Jiri Matousek

Let $K$ be a field of characteristic zero, let $\sigma$ be an automorphism of $K$ and let $\delta$ be a $\sigma$-derivation of $K$. We show that the division ring $D=K(x;\sigma,\delta)$ either has the property that every finitely generated…

Rings and Algebras · Mathematics 2015-08-03 Jason P. Bell , Jairo Z. Goncalves

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

Logic in Computer Science · Computer Science 2012-05-01 Sicun Gao , Jeremy Avigad , Edmund Clarke

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…

Algebraic Topology · Mathematics 2019-02-01 Li Yu

Let $\{\rho_{\ell}:\mathrm{Gal}_K\to\mathrm{GL}_n(\mathbb{Q}_{\ell})\}_{\ell}$ be a semisimple compatible system of $\ell$-adic representations of a number field $K$ that is arising from geometry. Let…

Number Theory · Mathematics 2026-04-07 Boyi Dai , Chun Yin Hui

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

Group Theory · Mathematics 2015-10-20 Attila Nagy

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Number Theory · Mathematics 2025-10-20 Harry Altman , Juan Arias de Reyna

Let $A$ be the product of an abelian variety and a torus defined over a number field $K$. Fix some prime number $\ell$. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Number Theory · Mathematics 2023-06-22 Davide Lombardo , Antonella Perucca

Solving nonlinear SMT problems over real numbers has wide applications in robotics and AI. While significant progress is made in solving quantifier-free SMT formulas in the domain, quantified formulas have been much less investigated. We…

Logic in Computer Science · Computer Science 2018-07-24 Soonho Kong , Armando Solar-Lezama , Sicun Gao

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Group Theory · Mathematics 2020-11-17 Timothy C. Burness , Cai Heng Li

We discuss the problem of non abelian constrained systems and the origin of appearance of non abelian algebras. We show that it is possible, in principle, to change a non abelian system to an abelian one, at least locally. Our method is…

High Energy Physics - Theory · Physics 2014-02-13 M. Dehghani , A. Shirzad

Let $\mathcal{N} \subset \mathbb{R}^M$ be a smooth simply connected compact manifold without boundary. A rational homotopy subgroup of $\pi_{N}(\mathcal{N})$ is represented by a homomorphism \[{\rm deg}: \pi_{N}(\mathcal{N}) \to…

Analysis of PDEs · Mathematics 2024-06-07 Woongbae Park , Armin Schikorra

Let $A(D)$ be an elliptic homogeneous linear differential operator of order $\nu$ on $\mathbb{R}^{N}$, $N \geq 2$, from a complex vector space E to a complex vector space F. In this paper we show that if $\ell\in \mathbb{R}$ satisfies $0<…

Analysis of PDEs · Mathematics 2018-09-25 Jorge Hounie , Tiago Picon

We present a new algorithm for deciding formula entailment in orthologic (a sound approximation of classical logic) that avoids the costly preprocessing phase of prior implementations while retaining the same $\mathcal{O}(n^2(1+|A|))$…

Logic in Computer Science · Computer Science 2026-05-19 Vladislas de Haldat , Simon Guilloud , Viktor Kunčak

We give the first sorting algorithm with bounds in terms of higher-order entropies: let $S$ be a sequence of length $m$ containing $n$ distinct elements and let (H_\ell (S)) be the $\ell$th-order empirical entropy of $S$, with (n^{\ell + 1}…

Data Structures and Algorithms · Computer Science 2007-05-23 Travis Gagie
‹ Prev 1 3 4 5 6 7 10 Next ›