More Like this

1. HARMONIC GRADIENTS ON HIGHER-DIMENSIONAL SIERPIŃSKI GASKETS

   https://doi.org/10.1142/S0218348X2050108X  

   BROWN, LUKE; FERRER, GIOVANNI; MOGRABY, GAMAL; ROGERS, LUKE G.; SANGAM, KARUNA (September 2020, Fractals)

   null (Ed.)

   We consider criteria for the differentiability of functions with continuous Laplacian on the Sierpiński Gasket and its higher-dimensional variants [Formula: see text], [Formula: see text], proving results that generalize those of Teplyaev [Gradients on fractals, J. Funct. Anal. 174(1) (2000) 128–154]. When [Formula: see text] is equipped with the standard Dirichlet form and measure [Formula: see text] we show there is a full [Formula: see text]-measure set on which continuity of the Laplacian implies existence of the gradient [Formula: see text], and that this set is not all of [Formula: see text]. We also show there is a class of non-uniform measures on the usual Sierpiński Gasket with the property that continuity of the Laplacian implies the gradient exists and is continuous everywhere in sharp contrast to the case with the standard measure. 

   more » « less
2. Ordinal definability and combinatorics of equivalence relations

   https://doi.org/10.1142/S0219061319500090  

   Chan, William (December 2019, Journal of Mathematical Logic)

   null (Ed.)

   Assume [Formula: see text]. Let [Formula: see text] be a [Formula: see text] equivalence relation coded in [Formula: see text]. [Formula: see text] has an ordinal definable equivalence class without any ordinal definable elements if and only if [Formula: see text] is unpinned. [Formula: see text] proves [Formula: see text]-class section uniformization when [Formula: see text] is a [Formula: see text] equivalence relation on [Formula: see text] which is pinned in every transitive model of [Formula: see text] containing the real which codes [Formula: see text]: Suppose [Formula: see text] is a relation on [Formula: see text] such that each section [Formula: see text] is an [Formula: see text]-class, then there is a function [Formula: see text] such that for all [Formula: see text], [Formula: see text]. [Formula: see text] proves that [Formula: see text] is Jónsson whenever [Formula: see text] is an ordinal: For every function [Formula: see text], there is an [Formula: see text] with [Formula: see text] in bijection with [Formula: see text] and [Formula: see text]. 

   more » « less
3. Almost Everywhere Behavior of Functions According to Partition Measures

   https://doi.org/10.1017/fms.2023.130  

   Chan, William; Jackson, Stephen; Trang, Nam (January 2024, Forum of Mathematics, Sigma)

   Abstract This paper will study almost everywhere behaviors of functions on partition spaces of cardinals possessing suitable partition properties. Almost everywhere continuity and monotonicity properties for functions on partition spaces will be established. These results will be applied to distinguish the cardinality of certain subsets of the power set of partition cardinals. The following summarizes the main results proved under suitable partition hypotheses.•If$$\kappa $$is a cardinal,$$\epsilon < \kappa $$,$${\mathrm {cof}}(\epsilon ) = \omega $$,$$\kappa \rightarrow _* (\kappa )^{\epsilon \cdot \epsilon }_2$$and$$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$$, then$$\Phi $$satisfies the almost everywhere short length continuity property: There is a club$$C \subseteq \kappa $$and a$$\delta < \epsilon $$so that for all$$f,g \in [C]^\epsilon _*$$, if$$f \upharpoonright \delta = g \upharpoonright \delta $$and$$\sup (f) = \sup (g)$$, then$$\Phi (f) = \Phi (g)$$.•If$$\kappa $$is a cardinal,$$\epsilon $$is countable,$$\kappa \rightarrow _* (\kappa )^{\epsilon \cdot \epsilon }_2$$holds and$$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$$, then$$\Phi $$satisfies the strong almost everywhere short length continuity property: There is a club$$C \subseteq \kappa $$and finitely many ordinals$$\delta _0, ..., \delta _k \leq \epsilon $$so that for all$$f,g \in [C]^\epsilon _*$$, if for all$$0 \leq i \leq k$$,$$\sup (f \upharpoonright \delta _i) = \sup (g \upharpoonright \delta _i)$$, then$$\Phi (f) = \Phi (g)$$.•If$$\kappa $$satisfies$$\kappa \rightarrow _* (\kappa )^\kappa _2$$,$$\epsilon \leq \kappa $$and$$\Phi : [\kappa ]^\epsilon _* \rightarrow \mathrm {ON}$$, then$$\Phi $$satisfies the almost everywhere monotonicity property: There is a club$$C \subseteq \kappa $$so that for all$$f,g \in [C]^\epsilon _*$$, if for all$$\alpha < \epsilon $$,$$f(\alpha ) \leq g(\alpha )$$, then$$\Phi (f) \leq \Phi (g)$$.•Suppose dependent choice ($$\mathsf {DC}$$),$${\omega _1} \rightarrow _* ({\omega _1})^{\omega _1}_2$$and the almost everywhere short length club uniformization principle for$${\omega _1}$$hold. Then every function$$\Phi : [{\omega _1}]^{\omega _1}_* \rightarrow {\omega _1}$$satisfies a finite continuity property with respect to closure points: Let$$\mathfrak {C}_f$$be the club of$$\alpha < {\omega _1}$$so that$$\sup (f \upharpoonright \alpha ) = \alpha $$. There is a club$$C \subseteq {\omega _1}$$and finitely many functions$$\Upsilon _0, ..., \Upsilon _{n - 1} : [C]^{\omega _1}_* \rightarrow {\omega _1}$$so that for all$$f \in [C]^{\omega _1}_*$$, for all$$g \in [C]^{\omega _1}_*$$, if$$\mathfrak {C}_g = \mathfrak {C}_f$$and for all$$i < n$$,$$\sup (g \upharpoonright \Upsilon _i(f)) = \sup (f \upharpoonright \Upsilon _i(f))$$, then$$\Phi (g) = \Phi (f)$$.•Suppose$$\kappa $$satisfies$$\kappa \rightarrow _* (\kappa )^\epsilon _2$$for all$$\epsilon < \kappa $$. For all$$\chi < \kappa $$,$$[\kappa ]^{<\kappa }$$does not inject into$${}^\chi \mathrm {ON}$$, the class of$$\chi $$-length sequences of ordinals, and therefore,$$|[\kappa ]^\chi | < |[\kappa ]^{<\kappa }|$$. As a consequence, under the axiom of determinacy$$(\mathsf {AD})$$, these two cardinality results hold when$$\kappa $$is one of the following weak or strong partition cardinals of determinacy:$${\omega _1}$$,$$\omega _2$$,$$\boldsymbol {\delta }_n^1$$(for all$$1 \leq n < \omega $$) and$$\boldsymbol {\delta }^2_1$$(assuming in addition$$\mathsf {DC}_{\mathbb {R}}$$). 

   more » « less
4. On Φ-variation for 1-d scalar conservation laws

   https://doi.org/10.1142/S0219891620500277  

   Jenssen, Helge Kristian; Ridder, Johanna (December 2020, Journal of Hyperbolic Differential Equations)

   null (Ed.)

   Let [Formula: see text] be a convex function satisfying [Formula: see text], [Formula: see text] for [Formula: see text], and [Formula: see text]. Consider the unique entropy admissible (i.e. Kružkov) solution [Formula: see text] of the scalar, 1-d Cauchy problem [Formula: see text], [Formula: see text]. For compactly supported data [Formula: see text] with bounded [Formula: see text]-variation, we realize the solution [Formula: see text] as a limit of front-tracking approximations and show that the [Formula: see text]-variation of (the right continuous version of) [Formula: see text] is non-increasing in time. We also establish the natural time-continuity estimate [Formula: see text] for [Formula: see text], where [Formula: see text] depends on [Formula: see text]. Finally, according to a theorem of Goffman–Moran–Waterman, any regulated function of compact support has bounded [Formula: see text]-variation for some [Formula: see text]. As a corollary we thus have: if [Formula: see text] is a regulated function, so is [Formula: see text] for all [Formula: see text]. 

   more » « less
5. Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k

   https://doi.org/10.1287/moor.2022.0259  

   Beideman, Calvin; Chandrasekaran, Karthekeyan; Wang, Weihang (December 2023, Mathematics of Operations Research)

   We consider the problem of enumerating optimal solutions for two hypergraph k-partitioning problems, namely, Hypergraph-k-Cut and Minmax-Hypergraph-k-Partition. The input in hypergraph k-partitioning problems is a hypergraph [Formula: see text] with positive hyperedge costs along with a fixed positive integer k. The goal is to find a partition of V into k nonempty parts [Formula: see text]—known as a k-partition—so as to minimize an objective of interest. (1) If the objective of interest is the maximum cut value of the parts, then the problem is known as Minmax-Hypergraph-k-Partition. A subset of hyperedges is a minmax-k-cut-set if it is the subset of hyperedges crossing an optimum k-partition for Minmax-Hypergraph-k-Partition. (2) If the objective of interest is the total cost of hyperedges crossing the k-partition, then the problem is known as Hypergraph-k-Cut. A subset of hyperedges is a min-k-cut-set if it is the subset of hyperedges crossing an optimum k-partition for Hypergraph-k-Cut. We give the first polynomial bound on the number of minmax-k-cut-sets and a polynomial-time algorithm to enumerate all of them in hypergraphs for every fixed k. Our technique is strong enough to also enable an [Formula: see text]-time deterministic algorithm to enumerate all min-k-cut-sets in hypergraphs, thus improving on the previously known [Formula: see text]-time deterministic algorithm, in which n is the number of vertices and p is the size of the hypergraph. The correctness analysis of our enumeration approach relies on a structural result that is a strong and unifying generalization of known structural results for Hypergraph-k-Cut and Minmax-Hypergraph-k-Partition. We believe that our structural result is likely to be of independent interest in the theory of hypergraphs (and graphs). Funding: All authors were supported by NSF AF 1814613 and 1907937. 

   more » « less