7.474.179 hasil
Menampilkan 1–20 · 1,61 detik · RSS
-
Preprint Teks lengkap
Convex cores for actions on finite-rank median algebras
We show that every action of a finitely generated group on a finite-rank median algebra admits a nonempty "convex core", even when no metric or topology is given. We then use this to deduce an analogue of the flat torus theorem for actions on connected finite-rank median spaces. We also prove that…
-
Preprint Teks lengkap
Efficient Binary Decision Diagram Manipulation in External Memory
We follow up on the idea of Lars Arge to rephrase the Reduce and Apply procedures of Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms. We identify multiple avenues to simplify and improve the performance of his proposed algorithms. Furthermore, we extend the technique to other…
-
Preprint Teks lengkap
Noise induced new quasi-period and periods switching
We employ a typical genetic circuit model to explore how noise can influence the dynamic structure. With the increase of a key interactive parameter, the model will deterministically go through two bifurcations and three dynamic structure regions. We find that a new quasi-periodic component, which…
-
Preprint Teks lengkap
Trace formalism for motivic cohomology
The goal of this paper is to construct trace maps for the six functor formalism of motivic cohomology after Voevodsky, Ayoub, and Cisinski-Déglise. We also construct an $\infty$-enhancement of such a trace formalism. In the course of the $\infty$-enhancement, we need to reinterpret the trace…
-
Preprint Teks lengkap
On automorphisms and splittings of special groups
We initiate the study of outer automorphism groups of special groups $G$, in the Haglund-Wise sense. We show that ${\rm Out}(G)$ is infinite if and only if $G$ splits over a co-abelian subgroup of a centraliser and there exists an infinite-order "generalised Dehn twist". Similarly, the…
-
Preprint Teks lengkap
Construction of a set of circulant matrix submatrices for faster MDS matrix verification
The present paper focuses on the construction of a set of submatrices of a circulant matrix such that it is a smaller set to verify that the circulant matrix is an MDS (maximum distance separable) one, comparing to the complete set of square submatrices needed in general case. The general MDS…
-
Preprint Teks lengkap
Ramified descent
We investigate the "ramified descent problem": which adelic points of a smooth geometrically connected variety $X$ defined over a number field $K$ can be approximated by points that lift to a (twist of a) given ramified cover? We show that the natural descent set corresponding to the problem…
-
Preprint Teks lengkap
Symplectomorphisms of some Weinstein 4-manifolds
Let M be a Weinstein four-manifold mirror to Y\D for (Y,D) a log Calabi--Yau surface; intuitively, this is typically the Milnor fibre of a smoothing of a cusp singularity. We introduce two families of symplectomorphisms of M: Lagrangian translations, which we prove are mirror to tensors with line…
-
Preprint Teks lengkap
Algorithmic Insurance
When AI systems make errors in high-stakes domains like medical diagnosis or autonomous vehicles, a single algorithmic flaw across varying operational contexts can generate highly heterogeneous losses that challenge traditional insurance assumptions. Algorithmic insurance constitutes a novel form…
-
Preprint Teks lengkap
Upper bounds for critical probabilities in Bernoulli Percolation models
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
-
Preprint Teks lengkap
Efficient Sampling for Ising and Potts Models using Auxiliary Gaussian Variables
Ising and Potts models are an important class of discrete probability distributions which originated from statistical physics and since then have found applications in several disciplines. Simulation from these models is a well known challenging problem. In this paper, we study a class of Markov…
-
Preprint Teks lengkap
Two-type branching processes with immigration, and the structured coalescents
We consider a population constituted by two types of individuals; each of them can produce offspring in two different islands (as a particular case the islands can be interpreted as active or dormant individuals). We model the evolution of the population of each type using a two-type Feller…
-
Preprint Teks lengkap
The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory
Let us consider a parametric weighted directed graph in which every arc $(j,i)$ has weight of the form $w((j,i))=\max(P_{ij}+λ,I_{ij}-λ,C_{ij})$, where $λ$ is a real parameter and $P$, $I$ and $C$ are arbitrary square matrices with elements in $\mathbb{R}\cup\{-\infty\}$. In this paper, we design…
-
Preprint Teks lengkap
Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
P-time event graphs (P-TEGs) are specific timed discrete-event systems, in which the timing of events is constrained by intervals. An important problem is to check, for all natural numbers $d$, the existence of consistent $d$-periodic trajectories for a given P-TEG. In graph theory, the…
-
Preprint Teks lengkap
Towards Understanding the COVID-19 Case Fatality Rate
An important parameter for COVID-19 is the case fatality rate (CFR). It has been applied to wide applications, including the measure of the severity of the infection, the estimation of the number of infected cases, risk assessment etc. However, there remains a lack of understanding on several…
-
Preprint Teks lengkap
Winner Team Mia at TextVQA Challenge 2021: Vision-and-Language Representation Learning with Pre-trained Sequence-to-Sequence Model
TextVQA requires models to read and reason about text in images to answer questions about them. Specifically, models need to incorporate a new modality of text present in the images and reason over it to answer TextVQA questions. In this challenge, we use generative model T5 for TextVQA task. Based…
-
Preprint Teks lengkap
Intersections of translates of finite-dimensionally valued frame spaces are conditionally slice-full and almost slice-full
In recent work, the topology of frame spaces $\mathcal{F}_{(X,μ),n}$ has been studied via Stiefel manifolds, revealing in particular a connectedness property for intersections of their translates when $\operatorname{span}(\{a_j\}_{j \in J}$ is not too large, in fact when…
-
Preprint Teks lengkap
Tangled Paths: A Random Graph Model from Mallows Permutations
We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0
-
Preprint Teks lengkap
Stein traces and characterizing slopes
We show that there exists an infinite family of pairwise non-isotopic Legendrian knots in the standard contact 3-sphere whose Stein traces are equivalent. This is the first example of such phenomenon. Different constructions are developed in the article, including a contact annulus twist, explicit…
-
Preprint Teks lengkap
On prescribing total preorders and linear orders to pairwise distances of points in Euclidean space
We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in $\mathbb{R}^{n-2}$ suffices. These bounds turn out to be optimal. We also…
Menampilkan maksimal 50 halaman. Persempit pencarian dengan filter untuk hasil yang lebih spesifik.