Results 51 to 60 of about 4,538 (218)
Philosophical Perspectives, EarlyView.ABSTRACT Joint inquiry requires agents to exchange public content about some target domain, which in turn requires them to track which content a linguistic form contributes to a conversation. But, often, the inquiry delivers a necessary truth. For example, if we are inquiring whether a particular bird, Tweety, is a woodpecker, and discover that it is ...
Una Stojnić, Matthew Stone
wiley +1 more source
, 2002 Poset games are two-player impartial combinatorial games, with normal play convention. Starting with any poset, the players take turns picking an element of the poset, and removing that and all larger elements from the poset.
Steven Byrnes, Byrnes, Steven
core +1 more source
Locally Quasi-Convex Compatible Topologies on a Topological Group
Axioms, 2015 For a locally quasi-convex topological abelian group (G,τ), we study the poset \(\mathscr{C}(G,τ)\) of all locally quasi-convex topologies on (G) that are compatible with (τ) (i.e., have the same dual as (G,τ) ordered by inclusion.
Lydia Außenhofer +2 more
doaj +1 more source
On-line Adaptive Chain Covering of Upgrowing Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain.
Bartłomiej Bosek, Piotr Micek
doaj +1 more source
On the cardinality of layers in even-valued n-dimensional lattice
Учёные записки Казанского университета: Серия Физико-математические науки, 2022 In this article, we explicitly calculated terms additional to the main one of cardinality asymptotics of central layers in the n-dimensional k-valued lattice Ekn for even k as n → ∞. The main term had been found by V.B.
T.V. Andreeva, Yu.S. Semenov
doaj +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
On Poset Sandwich Problems [PDF]
, 2003 International audienceA graph $G_s=(V,E_s)$ is a sandwich for a pair of graph $G_t=(V,E_t)$ and $G=(V,E)$ if $E_t\subseteq E_s\subseteq E$. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive.
Habib, Michel +3 more
core +1 more source
Lattices of Annihilators in Commutative Algebras Over Fields
Demonstratio Mathematica, 2015 Let K be any field and L be any lattice. In this note we show that L is a sublattice of annihilators in an associative and commutative K-algebra. If L is finite, then our algebra will be finite dimensional over K.
Jastrzebska M., Krempa J.
doaj +1 more source
Piecewise-linear and birational toggling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We define piecewise-linear and birational analogues of toggle-involutions, rowmotion, and promotion on order ideals of a poset $P$ as studied by Striker and Williams.
David Einstein, James Propp
doaj +1 more source
Beyond Topological Persistence: Starting from Networks
Mathematics, 2021 Persistent homology enables fast and computable comparison of topological objects. We give some instances of a recent extension of the theory of persistence, guaranteeing robustness and computability for relevant data types, like simple graphs and ...
Mattia G. Bergomi +3 more
doaj +1 more source