English
Related papers

Related papers: Locally Restricted Sequential Structures and Runs …

200 papers

The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

In this article we present two mechanisms for deducing logarithmic quantitative unique continuation bounds for certain classes of integral operators. In our first method, expanding the corresponding integral kernels, we exploit the…

Analysis of PDEs · Mathematics 2020-03-23 María Ángeles García-Ferrero , Angkana Rüland

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

Combinatorics · Mathematics 2010-11-17 William J. Keith , Rishi Nath

An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in…

Combinatorics · Mathematics 2023-06-22 Behrouz Zolfaghari , Mehran S. Fallah , Mehdi Sedighi

We consider overdetermined problems related to the fractional capacity. In particular we study $s$-harmonic functions defined in unbounded exterior sets or in bounded annular sets, and having a level set parallel to the boundary. We first…

Analysis of PDEs · Mathematics 2023-01-26 Giulio Ciraolo , Luigi Pollastro

Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…

Optimization and Control · Mathematics 2023-10-03 Torbjørn Cunis , Benoît Legat

High dimensional, sparsely populated data spaces have been characterized in terms of ultrametric topology. This implies that there are natural, not necessarily unique, tree or hierarchy structures defined by the ultrametric topology. In…

Computation and Language · Computer Science 2007-05-23 Fionn Murtagh

We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…

Combinatorics · Mathematics 2025-04-02 Johannes Carmesin , Will J. Turner

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

Logic · Mathematics 2025-12-03 Derek Aoki

A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…

Classical Analysis and ODEs · Mathematics 2007-05-23 J. B. Sanders , N. M. Temme

This paper investigates the behavior of sets and functions at infinity by introducing new concepts, namely directional normal cones at infinity for unbounded sets, along with limiting and singular subdifferentials at infinity in the…

Optimization and Control · Mathematics 2025-10-13 Le Ngoc Kien , Nguyen Van Tuyen , Tran Van Nghi

In [5] the structure of the bifurcation diagrams of a class of superlinear indefinite problems with a symmetric weight was ascertained, showing that they consist of a primary branch and secondary loops bifurcating from it. In [4] it has…

Classical Analysis and ODEs · Mathematics 2015-12-08 Andrea Tellini

The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…

Formal Languages and Automata Theory · Computer Science 2017-04-27 Samy Abbes

Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum length subsequence of a given string that contains at most one…

Data Structures and Algorithms · Computer Science 2021-06-23 Riccardo Dondi , Florian Sikora

Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…

Data Structures and Algorithms · Computer Science 2018-03-19 Tesshu Hanaka , Takehiro Ito , Haruka Mizuta , Benjamin Moore , Naomi Nishimura , Vijay Subramanya , Akira Suzuki , Krishna Vaidyanathan

We consider linear partial differential equations on resistance spaces that are uniformly elliptic and parabolic in the sense of quadratic forms and involve abstract gradient and divergence terms. Our main interest is to provide graph and…

Functional Analysis · Mathematics 2020-09-15 Michael Hinz , Melissa Meinert

Directed Algebraic Topology studies spaces equipped with a form of direction, to include models of non-reversible processes. In the present extension we also want to cover critical processes, indecomposable and unstoppable. The first part…

Algebraic Topology · Mathematics 2024-09-05 Marco Grandis

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini

We reduce the local limit theorem for a non-compact semisimple Lie group acting on its symmetric space to establishing that a natural operator associated to the measure is quasicompact. Under strong Diophantine assumptions on the underlying…

Probability · Mathematics 2024-10-10 Constantin Kogler

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

Machine Learning · Statistics 2021-07-22 Dominik Kloepfer , Angelica I. Aviles-Rivero , Daniel Heydecker