Results for finite · 0.158s

Sponsored
Sponsored Partners
arxiv.org/abs/2201.10964v1

Pillai's conjecture for polynomials

In this paper we study the polynomial version of Pillai's conjecture on the exponential Diophantine equation \begin{equation*} p^n - q^m = f. \end{equation*} We prove that for any non-constant polynomial $ f $ there are only finitely many vectors $...

arxiv.org/abs/1707.00295v3

On almost-equidistant sets

A finite set of points in $\mathbb R^d$ is called almost-equidistant if among any three distinct points in the set, some two are at unit distance. We prove that an almost-equidistant set in $\mathbb R^d$ has cardinality at most $5d^{13/9}$....

github.com/OMS-NetZero/FAIR

OMS-NetZero/FAIR

Finite-amplitude Impulse Response simple climate model (⭐ 151)

github.com/feelpp/feelpp

feelpp/feelpp

:gem: Feel++: Finite Element Embedded Language and Library in C++ (⭐ 325)

arxiv.org/abs/2203.04834v1

Computing unsatisfiable cores for LTLf specifications

Linear-time temporal logic on finite traces (LTLf) is rapidly becoming a de-facto standard to produce specifications in many application domains (e.g., planning, business process management, run-time monitoring, reactive synthesis). Several studies a...

arxiv.org/abs/0711.0802v1

Flattening Functions on Flowers

Let $T$ be an orientation-preserving Lipschitz expanding map of the circle $\T$. A pre-image selector is a map $τ:\T\to\T$ with finitely many discontinuities, each of which is a jump discontinuity, and such that $τ(x)\in T^{-1}(x)$ for all $x\in\...

arxiv.org/abs/1602.05940v2

One-Counter Automata with Counter Observability

In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion for OCAs ar...

arxiv.org/abs/1709.02348v2

Ping-pong configurations and circular orders on free groups

We discuss actions of free groups on the circle with "ping-pong" dynamics; these are dynamics determined by a finite amount of combinatorial data, analogous to Schottky domains or Markov partitions. Using this, we show that the free group $F_n$ admit...

arxiv.org/abs/1405.7905v1

BOUT++: Recent and current developments

BOUT++ is a 3D nonlinear finite-difference plasma simulation code, capable of solving quite general systems of PDEs, but targeted particularly on studies of the edge region of tokamak plasmas. BOUT++ is publicly available, and has been adopted by a g...

arxiv.org/abs/math/0210248v2

Invariants Associated to Orthogonal $ε$-constants

In this paper we use the theory of $ε$-constants associated to tame finite group actions on arithmetic surfaces to define a Brauer group invariant $μ(\X,G,V)$ associated to certain symplectic motives of weight one. We then discuss the relationshi...

arxiv.org/abs/1508.05401v2

Critical Groups of Graphs with Dihedral Actions II

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$, extending earlier work by the author and Criel Merino. In particular, we show that the critical group of such a graph ca...

arxiv.org/abs/1503.08792v1

Graphs Identified by Logics with Counting

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a structure...

arxiv.org/abs/1905.00316v3

Large, lengthy graphs look locally like lines

We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a graph, there...

arxiv.org/abs/1801.05783v1

The Uniform Electron Gas at Warm Dense Matter Conditions

We review the uniform electron gas (UEG) at finite temperature and over a broad density range relevant for warm dense matter (WDM) applications. We provide an overview of different simulation techniques, focusing on recent developments in the dielect...

arxiv.org/abs/1709.00677v1

Essential dimension of infinitesimal unipotent group schemes

We propose a generalization of Ledet conjecture, which predicts the essential dimension of cyclic $p$-groups in characteristic $p$, for finite commutative unipotent group schemes. And we show some evidence and some consequences of this new conjecture...

arxiv.org/abs/2009.01045v4

On minimal coverings of groups by proper normalizers

For a group $G$, a {\it normalizer covering} of $G$ is a finite set of proper normalizers of some subgroups of $G$ whose union is $G$. We study $p$-groups ($p$ a prime) without a normalizer covering. As an application, we determine some non-nilpotent...

arxiv.org/abs/0811.4001v3

Separation of Relatively Quasiconvex Subgroups

Suppose that all hyperbolic groups are residually finite. The following statements follow: In relatively hyperbolic groups with peripheral structures consisting of finitely generated nilpotent subgroups, quasiconvex subgroups are separable; Geometr...

arxiv.org/abs/1908.03545v3

Cubulating Surface-by-free Groups

Let $$1 \to H \to G \to Q \to 1$$ be an exact sequence where $H= π_1(S)$ is the fundamental group of a closed surface $S$ of genus greater than one, $G$ is hyperbolic and $Q$ is finitely generated free. The aim of this paper is to provide sufficient...

arxiv.org/abs/1502.00825v2

A general fibre theorem for moment problems and some applications

The fibre theorem \cite{schm2003} for the moment problem on closed semi-algebraic subsets of $\R^d$ is generalized to finitely generated real unital algebras. As an application two new theorems on the rational multidimensional moment problem are prov...

arxiv.org/abs/1209.2578v5

On subshift presentations

We consider partitioned graphs, by which we mean finite strongly connected directed graphs with a partitioned edge set $ {\mathcal E} ={\mathcal E}^- \cup{\mathcal E}^+$. With additionally given a relation $\mathcal R$ between the edges in ${\mathcal...

arxiv.org/abs/1003.5117v2

On the difficulty of presenting finitely presentable groups

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of integer matrices...

arxiv.org/abs/cs/0306041v1

Monodic temporal resolution

Until recently, First-Order Temporal Logic (FOTL) has been little understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However, a break...

arxiv.org/abs/2208.09946v1

Tense logic based on finite orthomodular posets

It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators on such a...

arxiv.org/abs/1409.5199v5

A quantitative Burton-Keane estimate under strong FKG condition

We consider translationally-invariant percolation models on $\mathbb{Z}^d$ satisfying the finite energy and the FKG properties. We provide explicit upper bounds on the probability of having two distinct clusters going from the endpoints of an edge to...

arxiv.org/abs/1510.06284v3

Pathwise duals of monotone and additive Markov processes

This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and whose generato...

Sponsored