Results 71 to 80 of about 523 (235)
Journal of Combinatorial Theory, Series A, 1988 A poset of shuffles is defined as follows: Let \b{x}\(=x_ 1x_ 2...x_ m\) and \b{y}\(=y_ 1y_ 2...y_ m\) be words, where it is assumed that the letters occurring in \b{x} and \b{y} are all distinct. Let \(W_{\underline x,\underline y}\) denote the set of all words \b{w} with letters from \b{x} and \b{y} such that the restriction of \b{w} to the letters ...
openaire +3 more sources
Holomorphic field theories and higher algebra
Bulletin of the London Mathematical Society, Volume 57, Issue 10, Page 2903-2974, October 2025.Abstract Aimed at complex geometers and representation theorists, this survey explores higher dimensional analogs of the rich interplay between Riemann surfaces, Virasoro and Kac‐Moody Lie algebras, and conformal blocks. We introduce a panoply of examples from physics — field theories that are holomorphic in nature, such as holomorphic Chern‐Simons ...
Owen Gwilliam, Brian R. Williams
wiley +1 more source
Tiled orders over a discrete valuation ring and Frobenius full matrix algebras with structure systems [PDF]
, 2008 Thesis (Ph. D. in Science)--University of Tsukuba, (A), no.
酒井 洋介
core
, 2013 Let X be a finite set. This paper describes some topological and combinatorial properties of the poset _X of order relations on X. In particular, the homotopy type of all the intervals in _X is precisely determined, and the M bius function of _X is computed.
openaire +2 more sources
Journal of Combinatorial Theory, Series A, 1993 One sure sign of a successful generalization of a particular theory is an extension of language and technique to a larger domain permitting one to reconstruct considerable parts of previous theory on such a new basis. Another such sign is to provide new interpretations and insights captured by such an extended theory, especially involving results ...
openaire +3 more sources
Tight bounds for intersection‐reverse sequences, edge‐ordered graphs, and applications
Journal of the London Mathematical Society, Volume 112, Issue 4, October 2025.Abstract In 2006, Marcus and Tardos proved that if A1,⋯,An$A^1,\dots,A^n$ are cyclic orders on some subsets of a set of n$n$ symbols such that the common elements of any two distinct orders Ai$A^i$ and Aj$A^j$ appear in reversed cyclic order in Ai$A^i$ and Aj$A^j$, then ∑i|Ai|=O(n3/2logn)$\sum _{i} |A^i|=O(n^{3/2}\log n)$.
Barnabás Janzer +3 more
wiley +1 more source
Corporate Social Responsibility and Environmental Management, Volume 32, Issue 5, Page 7119-7145, September 2025.ABSTRACT The consequences of climate change have underscored the need for greater environmental responsibility, leading companies to increase their efforts in developing sustainable practices, including eco‐innovation strategies. Such initiatives have aroused the interest of academics and professionals worldwide, particularly in the last decade ...
Germán López‐Pérez +3 more
wiley +1 more source
A Privacy Score for Anonymous Databases [PDF]
, 2021 In this thesis, we present a quantitative measure called the Database Privacy Score to assess the level of privacy in an anonymous database. Individuals in an anonymous database are still at risk of having personal information uncovered about them in ...
White, Lindsay A.
core
Journal of Algebraic Combinatorics, 2021 Motivated by the theory of correspondence functors, we introduce the notion of {\em germ} in a finite poset, and the notion of {\em germ extension} of a poset. We show that any finite poset admits a largest germ extension called its {\em germ closure}. We say that a subset $U$ of a finite lattice $T$ is {\em germ extensible} in $T$ if the germ closure ...
openaire +4 more sources