Results 21 to 30 of about 1,616 (70)

Tropical Lagrangian hypersurfaces are unobstructed

open access: yesJournal of Topology, Volume 13, Issue 4, Page 1409-1454, December 2020., 2020
Abstract We produce for each tropical hypersurface V(ϕ)⊂Q=Rn a Lagrangian L(ϕ)⊂(C∗)n whose moment map projection is a tropical amoeba of V(ϕ). When these Lagrangians are admissible in the Fukaya–Seidel category, we show that they are unobstructed objects of the Fukaya category, and mirror to sheaves supported on complex hypersurfaces in a toric mirror.
Jeffrey Hicks
wiley   +1 more source

Existence Theorem for Impulsive Differential Equations with Measurable Right Side for Handling Delay Problems

open access: yesJournal of Mathematics, Volume 2020, Issue 1, 2020., 2020
Due to noncontinuous solution, impulsive differential equations with delay may have a measurable right side and not a continuous one. In order to support handling impulsive differential equations with delay like in other chapters of differential equations, we formulated and proved existence and uniqueness theorems for impulsive differential equations ...
Z. Lipcsey   +4 more
wiley   +1 more source

Bi-Interior Ideals of Γ-Semirings

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2018
In this paper, as a further generalization of ideals, we introduce the notion of bi-interior ideal as a generalization of quasi ideal, bi-ideal and interior ideal of Γ-semiring and study the properties of bi-interior ideals of Γ-semiring.
Rao Marapureddy Murali Krishna   +1 more
doaj   +1 more source

Sound and complete axiomatizations of coalgebraic language equivalence [PDF]

open access: yes, 2013
Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and ...
Aczel P.   +11 more
core   +4 more sources

Towards a Uniform Theory of Effectful State Machines

open access: yes, 2020
Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata.
Goncharov, Sergey   +2 more
core   +2 more sources

A Definition Scheme for Quantitative Bisimulation [PDF]

open access: yes, 2015
FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata.
de Vink, Erik   +2 more
core   +2 more sources

Faster Algorithms for Weighted Recursive State Machines

open access: yes, 2017
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many ...
A Bouajjani   +20 more
core   +1 more source

Weighted Automata and Logics for Infinite Nested Words

open access: yes, 2014
Nested words introduced by Alur and Madhusudan are used to capture structures with both linear and hierarchical order, e.g. XML documents, without losing valuable closure properties.
B. Bollig   +13 more
core   +1 more source

Moments, sums of squares, and tropicalization

open access: yesJournal of the London Mathematical Society, Volume 112, Issue 4, October 2025.
Abstract We use tropicalization to study the duals to cones of nonnegative polynomials and sums of squares on a semialgebraic set S$S$. The truncated cones of moments of measures supported on the set S$S$ are dual to nonnegative polynomials on S$S$, while “pseudomoments” are dual to sums of squares approximations to nonnegative polynomials.
Grigoriy Blekherman   +4 more
wiley   +1 more source

Geometric realizations of the s‐weak order and its lattice quotients

open access: yesJournal of the London Mathematical Society, Volume 112, Issue 3, September 2025.
Abstract For an n$n$‐tuple s${\bm{s}}$ of nonnegative integers, the s${\bm{s}}$‐weak order is a lattice structure on s${\bm{s}}$‐trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the forcing order of the s${\bm{s}}$‐weak order in terms of combinatorial objects ...
Eva Philippe, Vincent Pilaud
wiley   +1 more source

Home - About - Disclaimer - Privacy