We investigate the extendibility problem for Brauer states, focusing on the symmetric two-sided extendibility and the de Finetti extendibility. By employing the representation theory of the unitary and orthogonal groups, we provide a general recipe for determining the set of $(n,m)$-extendible and $n$-de Finetti-extendible Brauer states. From the concrete form of the commutant of the diagonal action of the orthogonal group, we explicitly determine the set of parameters for which the Brauer states are $(1,2)$-, $(1,3)$- and $(2,2)$-extendible in any dimension $d$ and find that Brauer states extend with a non-trivial trade-off in $n$ and $m$. Using the same recipe we also provide an estimate of the set of $(1,m)$-extendible Brauer states for any $m$ and dimension $d$. Finally, using the branching rules from $\mathrm{U}(d)$ to $\mathrm{O}(d)$, we obtain the set of $n$-de Finetti-extendible Brauer states in any dimension, and also analytically describe the $n\to\infty$ limiting shape which turns out not to be a polygon for odd dimensions.
A finite group G is said to be a cut group if all central units in the integral group ring ZG are trivial. In this article, we extend the notion of cut groups, by introducing extended cut groups. We study the properties of extended cut groups analogous to those known for cut groups and also characterise some substantial classes of groups having the property of being extended cut. A complete classification of extended cut split metacyclic groups has been presented.
The recently introduced dependent typed higher-order logic (DHOL) offers an interesting compromise between expressiveness and automation support. It sacrifices the decidability of its type system in order to significantly extend its expressiveness over standard HOL. Yet it retains strong automated theorem proving support via a sound and complete translation to HOL. We leverage this design to extend DHOL with refinement and quotient types. Both of these are commonly requested by practitioners but rarely provided by automated theorem provers. This is because they inherently require undecidable typing and thus are very difficult to retrofit to decidable type systems. But with DHOL already doing the heavy lifting, adding them is not only possible but elegant and simple. Concretely, we add refinement and quotient types as special cases of subtyping. This turns the associated canonical inclusion resp. projection maps into identity maps and thus avoids costly changes in representation. We present the syntax, semantics, and translation to HOL for the extended language, including the proofs of soundness and completeness.
We use our extension of the symbolic method in enumerative combinatorics (we extend finite sums defining coefficients in generating functions to infinite series) to generalize Pólya's theorem. This theorem determines limits of probabilities that walks in the grid graph $\mathbb{Z}^d$, starting at the origin, visit the given vertex. We extend $\mathbb{Z}^d$ to the countable complete graph $K_{\mathbb{N}}$ with weighted edges.
Kottwitz suggested to study all extended pure inner forms together in the local Langlands correspondence for linear reductive groups. We extend this philosophy to a large class of covers, including those defined by Brylinski and Deligne, and explain its relation with Weissman's observation that L-packets for covers are sometimes empty.
We construct examples of families of pairs over a DVR of positive characteristic, with very mild singularities, such that the MMP on the closed fiber does not extend to a relative MMP.
The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be extended to a Hamilton cycle, i.e., to a cycle that visits every vertex exactly once. We prove that every matching of $Q_d$, $d\ge 2$, can be extended to a cycle that visits at least a $2/3$-fraction of all vertices.
We begin this note with a von Neumann algebraic version of the elementary but extremely useful fact about being able to extend inner-product preserving maps from a total set of the domain Hilbert space to an isometry defined on the entire domain. This leads us to the notion of when `good' endomorphisms of a factorial probability space $(M,φ)$ (which we call equi-modular) admit a natural extension to endomorphisms of $L^2(M,φ)$. We exhibit examples of such extendable endomorphisms. We then pass to $E_0$-semigroups $α= {α_t: t \geq 0}$ of factors, and observe that extendability of this semigroup (i.e., extendability of each $α_t$) is a cocycle-conjugacy invariant of the semigroup. We identify a necessary condition for extendability of such an $E_0$-semigroup, which we then use to show that the Clifford flow on the hyperfinite $II_1$ factor is not extendable.
We prove the existence of finite groups of orientation-preserving homeomorphisms of some closed orientable surface $S$ that act freely and which extends as a group of homeomorphisms of some compact orientable $3$-manifold with boundary $S$, but which cannot extend to a handlebody.
We define a metric in the space of positive finite positive measures that extends the 2-Wasserstein metric, i.e. its restriction to the set of probability measures is the 2-Wasserstein metric. We prove a dual and a dynamic formulation and extend the gradient flow machinery of the Wasserstein space. In addition, we relate the barycenter in this space to the barycenter in the Wasserstein space of the normalized measures.
In this work we introduce a new concept, namely, $τ_{s}$-extending modules (rings) which is torsion-theoretic analogues of extending modules and then we extend many results from extending modules to this new concept. For instance we show that for any ring $R$ with unit, if $R$ is purely $τ_{s}$-extending then every cyclic $τ$-nonsingular $R$-module is flat and we show that this fact is true over a principal ideal domain as well. Also, we make a classification for the direct sums of the rings to be purely $τ_{s}$-extending.
This paper studies the log-convexity of the extended beta functions. As a consequence, Turán-type inequalities are established.The monotonicity, log-convexity, log-concavity of extended hypergeometric functions are deduced by using the inequalities on extended beta functions,. The particular cases of those results also gives the Turán-type inequalities for extended confluent and extended Gaussian hypergeometric functions. Some reverse of Turán-type inequalities also derived.
Motivated by extended black hole thermodynamics, we generalize the Rényi entropy of charged holographic conformal field theories (CFTs) in $d$-dimensions. Specifically, following (1807.09215), we extend the quench description of the Rényi entropy of globally charged holographic CFTs by including pressure variations of charged hyperbolically sliced anti de Sitter black holes. We provide an exhaustive analysis of the new type of charged Rényi entropy, where we find an interesting interplay between a parameter controlling the pressure of the black hole and its charge. A field theoretic interpretation of this extended charged Rényi entropy is given. In particular, in $d=2$, where the bulk geometry becomes the charged Bañados, Teitelboim, Zanelli black hole, we write down the extended charged Rényi entropy in terms of the twist operators of the charged field theory. An area law prescription for the extended Rényi entropy is formulated. We comment on several avenues for future work, including how global charge conservation relates to black hole super-entropicity.
Circuits and extended formulations are classical concepts in linear programming theory. The circuits of a polyhedron are the elementary difference vectors between feasible points and include all edge directions. We study the connection between the circuits of a polyhedron $P$ and those of an extended formulation of $P$, i.e., a description of a polyhedron $Q$ that linearly projects onto $P$. It is well known that the edge directions of $P$ are images of edge directions of $Q$. We show that this `inheritance' under taking projections does not extend to the set of circuits. We provide counterexamples with a provably minimal number of facets, vertices, and extreme rays, including relevant polytopes from clustering, and show that the difference in the number of circuits that are inherited and those that are not can be exponentially large in the dimension. We further prove that counterexamples exist for any fixed linear projection map, unless the map is injective. Finally, we characterize those polyhedra $P$ whose circuits are inherited from all polyhedra $Q$ that linearly project onto $P$. Conversely, we prove that every polyhedron $Q$ satisfying mild assumptions can be projected in su
We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with powerset fall in this last subclass.
We extend for the second time the Nonstandard Analysis by adding the left monad closed to the right, and right monad closed to the left, while besides the pierced binad (we introduced in 1998) we add now the unpierced binad - all these in order to close the newly extended nonstandard space under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations. Then, we extend the Nonstandard Neutrosophic Logic, Nonstandard Neutrosophic Set, and Nonstandard Probability on this Extended Nonstandard Analysis space - that we prove it is a nonstandard neutrosophic lattice of first type (endowed with a nonstandard neutrosophic partial order) as well as a nonstandard neutrosophic lattice of second type (as algebraic structure, endowed with two binary neutrosophic laws, inf_N and sup_N). Many theorems, new terms introduced, and examples of nonstandard neutrosophic operations are given.
We point out that a quantum system with a strongly positive quantum measure or decoherence functional gives rise to a vector valued measure whose domain is the algebra of events or physical questions. This gives an immediate handle on the question of the extension of the decoherence functional to the sigma algebra generated by this algebra of events. It is on the latter that the physical transition amplitudes directly give the decoherence functional. Since the full sigma algebra contains physically interesting questions, like the return question, extending the decoherence functional to these more general questions is important. We show that the decoherence functional, and hence the quantum measure, extends if and only if the associated vector measure does. We give two examples of quantum systems whose decoherence functionals do not extend: one is a unitary system with finitely many states, and the other is a quantum sequential growth model for causal sets. These examples fail to extend in the formal mathematical sense and we speculate on whether the conditions for extension are unphysically strong.
Criticality has been proposed as a mechanism for the emergence of complexity, life, and computation, as it exhibits a balance between robustness and adaptability. In classic models of complex systems where structure and dynamics are considered homogeneous, criticality is restricted to phase transitions, leading either to robust (ordered) or adaptive (chaotic) phases in most of the parameter space. Many real-world complex systems, however, are not homogeneous. Some elements change in time faster than others, with slower elements (usually the most relevant) providing robustness, and faster ones being adaptive. Structural patterns of connectivity are also typically heterogeneous, characterized by few elements with many interactions and most elements with only a few. Here we take a few traditionally homogeneous dynamical models and explore their heterogeneous versions, finding evidence that heterogeneity extends criticality. Thus, parameter fine-tuning is not necessary to reach a phase transition and obtain the benefits of (homogeneous) criticality. Simply adding heterogeneity can extend criticality, making the search/evolution of complex systems faster and more reliable. Our results a
In this paper we generalize the framework proposed by Gour and Tomamichel regarding extensions of monotones for resource theories. A monotone for a resource theory assigns a real number to each resource in the theory signifying the utility or the value of the resource. Gour and Tomamichel studied the problem of extending monotones using set-theoretical framework when a resource theory embeds fully and faithfully into the larger theory. One can generalize the problem of computing monotone extensions to scenarios when there exists a functorial transformation of one resource theory to another instead of just a full and faithful inclusion. In this article, we show that (point-wise) Kan extensions provide a precise categorical framework to describe and compute such extensions of monotones. To set up monotone extensions using Kan extensions, we introduce partitioned categories (pCat)as a framework for resource theories and pCat functors to formalize relationship between resource theories. We describe monotones as pCat functors into the preorder of non-negative real numbers, and describe extending monotones along any pCat functor using Kan extensions. We show how our framework works by ap
We extend the analogy between the extended Robba rings of p-adic Hodge theory and the one-dimensional affinoid algebras of rigid analytic geometry, proving some fundamental properties that are well known in the latter case. In particular, we show that these rings are regular and excellent. The extended Robba rings are of interest as they are used to build the Fargues-Fontaine curve.