Simple Proof Research Articles

Face‐simple minimal quadrangulations of surfaces

AbstractFor each surface besides the sphere, projective plane, and Klein bottle, we construct a face‐simple minimal quadrangulation, that is, a simple quadrangulation on the fewest number of vertices possible, whose dual is also a simple graph. Our result answers a question of Liu, Ellingham, and Ye while providing a simpler proof of their main result. The inductive construction is based on an earlier idea for finding near‐quadrangular embeddings of the complete graphs using the diamond sum operation.

Lagrange expansion formula and its application in combinatorial mathematics

There is a uniqueness theorem for an implicit function. When a function satisfies certain conditions, the equation can determine a unique implicit function. However, we cannot determine the display expression of the implicit function according to this theorem. The Lagrange expansion formula just compensates for this disadvantage, which explicitly gives the display expression of the implicit function. This paper will give a simpler proof of the Lagrange expansion formula and provide examples to illustrate its application in combinatorial mathematics.

On Ramanujan’s modular equations of degree three

The object of this article is to give new and simple proof of all but one Ramanujan’s modular equations of degree 3.

On some Schläfli type modular equations

On page 90 of his first notebook Ramanujan has recorded many Schl¨afli type modular equations. This article aims to give new and simple proof of Sch¨alflitype modular equation of degree 11 which was recorded by Ramanujan and a degree 23 modular equation. We use parametrization method to prove these modular equations.

Corrigendum to “A simpler proof of toroidalization of morphisms from 3-folds to surfaces”

Corrigendum to “A simpler proof of toroidalization of morphisms from 3-folds to surfaces”

Compositionality and Observational Refinement for Linearizability with Crashes

Crash-safety is an important property of real systems, as the main functionality of some systems is resilience to crashes. Toward a compositional verification approach for crash-safety under full-system crashes, one observes that crashes propagate instantaneously to all components across all levels of abstraction, even to unspecified components, hindering compositionality. Furthermore, in the presence of concurrency, a correctness criterion that addresses both crashes and concurrency proves necessary. For this, several adaptations of linearizability have been suggested, each featuring different trade-offs between complexity and expressiveness. The recently proposed compositional linearizability framework shows that to achieve compositionality with linearizability, both a locality and observational refinement property are necessary. Despite that, no linearizability criterion with crashes has been proven to support an observational refinement property. In this paper, we define a compositional model of concurrent computation with full-system crashes. We use this model to develop a compositional theory of linearizability with crashes, which reveals a criterion, crash-aware linearizability , as its inherent notion of linearizability and supports both locality and observational refinement. We then show that strict linearizability and durable linearizability factor through crash-aware linearizability as two different ways of translating between concurrent computation with and without crashes, enabling simple proofs of locality and observational refinement for a generalization of these two criteria. Then, we show how the theory can be connected with a program logic for durable and crash-aware linearizability, which gives the first program logic that verifies a form of linearizability with crashes. We showcase the advantages of compositionality by verifying a library facilitating programming persistent data structures and a fragment of a transactional interface for a file system.

Global Existence in the Critical Space for the Space-Time Monopole Equations

We prove the global existence of solutions in the critical space \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$L^1({\\mathbb {R}})$$\\end{document} for space-time monopole equations under the Lorenz gauge condition. The existence of a global solution was showed in our previous paper. Here we adapt a different function space to allow for a simplified proof. We first prove the local existence in \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$L^1({\\mathbb {R}})$$\\end{document} and extend the local solution to the global one.

A generalisation of b a < a b when e ≤ a < b

In this short note we give a simple proof of a generalization of the inequality obtained in Chakraborty [(2022). A visual proof that International Journal of Mathematical Education in Science and Technology, 55(5), 1291–1292], as well as of similar inequalities.

Invariant idempotent ⁎-measures generated by iterated function systems

It is known that every continuous t-norm ⁎ generates a functor of the so-called ⁎-measures in the category of compact Hausdorff spaces. Similarly to the case of the hyperspace functor and the probability measure functors one can define the notion of invariant ⁎-measure for iterated function systems of contractions on compact metric spaces.We provide a simple proof of existence and uniqueness of invariant ⁎-measures. Some examples of invariant ⁎-measures, for different t-norms ⁎, are presented.

Perspective on complexity measures targeting read-once branching programs

A model of computation for which reasonable yet still incomplete lower bounds are known is the read-once branching program. Here variants of complexity measures successful in the study of read-once branching programs are defined and studied. Some new or simpler proofs of known bounds are uncovered. Branching program resources and the new measures are compared extensively. The new variants are developed in part in the hope of tackling read-k branching programs for the tree evaluation problem [8]. Other computation problems are studied as well. In particular, a common view of a function studied by Gál [11] and a function studied by Bollig and Wegener [3] leads to the general combinatorics of blocking sets. Technical combinatorial results of independent interest are obtained. New leads towards further progress are discussed. An exponential lower bound for non-deterministic read-k branching programs for the GEN function [17] is also derived, independently from the new measures.

The International Arbitration Award as a Simple Proof Requirement in Bankruptcy

The International Arbitration Award as a Simple Proof Requirement in Bankruptcy

Statistically optimal firstorder algorithms: a proof via orthogonalization

Abstract We consider a class of statistical estimation problems in which we are given a random data matrix ${\boldsymbol{X}}\in{\mathbb{R}}^{n\times d}$ (and possibly some labels ${\boldsymbol{y}}\in{\mathbb{R}}^{n}$) and would like to estimate a coefficient vector ${\boldsymbol{\theta }}\in{\mathbb{R}}^{d}$ (or possibly a constant number of such vectors). Special cases include low-rank matrix estimation and regularized estimation in generalized linear models (e.g. sparse regression). Firstorder methods proceed by iteratively multiplying current estimates by ${\boldsymbol{X}}$ or its transpose. Examples include gradient descent or its accelerated variants. Under the assumption that the data matrix ${\boldsymbol{X}}$ is standard Gaussian, Celentano, Montanari, Wu (2020, Conference on Learning Theory, pp. 1078–1141. PMLR) proved that for any constant number of iterations (matrix vector multiplications), the optimal firstorder algorithm is a specific approximate message passing algorithm (known as ‘Bayes AMP’). The error of this estimator can be characterized in the high-dimensional asymptotics $n,d\to \infty $, $n/d\to \delta $, and provides a lower bound to the estimation error of any firstorder algorithm. Here we present a simpler proof of the same result, and generalize it to broader classes of data distributions and of firstorder algorithms, including algorithms with non-separable nonlinearities. Most importantly, the new proof is simpler, does not require to construct an equivalent tree-structured estimation problem, and is therefore susceptible of a broader range of applications.

Geodesic vector fields, induced contact structures and tightness in dimension three

In this paper, we provide new and simpler proofs of two theorems of Gluck and Harrison on contact structures induced by great circle or line fibrations. Furthermore, we prove that a geodesic vector field whose Jacobi tensor is parallel along flow lines (e.g. if the underlying manifold is locally symmetric) induces a contact structure if the ‘mixed’ sectional curvatures are nonnegative, and if a certain nondegeneracy condition holds. Additionally, we prove that in dimension three, contact structures admitting a Reeb flow which is either periodic, isometric, or free and proper, must be universally tight. In particular, we generalise an earlier result of Geiges and the author, by showing that every contact form on R3\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathbb {R}}^3$$\\end{document} whose Reeb vector field spans a line fibration is necessarily tight. Furthermore, we provide a characterisation of isometric Reeb vector fields. As an application, we recover a result of Kegel and Lange on Seifert fibrations spanned by Reeb vector fields, and we classify closed contact 3-manifolds with isometric Reeb flows (also known as R-contact manifolds) up to diffeomorphism.

Revisiting the region determined by Spearman’s [formula omitted] and Spearman’s footrule [formula omitted]

Kokol and Stopar (2023) recently studied the exact region Ωϕ,ρ determined by Spearman’s footrule ϕ and Spearman’s ρ and derived a sharp lower, as well as a non-sharp upper bound for ρ given ϕ. Considering that the proofs for establishing these inequalities are novel and interesting, but technically quite involved we here provide alternative simpler proofs mainly building upon shuffles, symmetry, denseness and mass shifting. As a by-product of these proofs we derive several additional results on shuffle rearrangements and the interplay between diagonal copulas and shuffles which are of independent interest. Moreover we finally show that we can get closer to the (non-sharp) upper bound than established in the literature so far.

Perfect Monomial Prediction for Modular Addition

Modular addition is often the most complex component of typical Addition- Rotation-XOR (ARX) ciphers, and the division property is the most effective tool for detecting integral distinguishers. Thus, having a precise division property model for modular addition is crucial in the search for integral distinguishers in ARX ciphers. Current division property models for modular addition either (a) express the operation as a Boolean circuit and apply standard propagation rules for basic operations (COPY, XOR, AND), or (b) treat it as a sequence of smaller functions with carry bits, modeling each function individually. Both approaches were originally proposed for the twosubset bit-based division property (2BDP), which is theoretically imprecise and may overlook some balanced bits.Recently, more precise versions of the division property, such as parity sets, threesubset bit-based division property without unknown subsets (3BDPwoU) or monomial prediction (MP), and algebraic transition matrices have been proposed. However, little attention has been given to modular addition within these precise models.The propagation rule for the precise division property of a vectorial Boolean function f requires that u can propagate to v if and only if the monomial πu(x) appears in πv(f). Braeken and Semaev (FSE 2005) studied the algebraic structure of modular addition and showed that for x ⊞ y = z, the monomial πu(x)πv(y) appears in πw(z) if and only if u + v = w. Their theorem directly leads to a precise division property model for modular addition. Surprisingly, this model has not been applied in division property searches, to the best of our knowledge.In this paper, we apply Braeken and Semaev’s theorem to search for integral distinguishers in ARX ciphers, leading to several new results. First, we improve the state-of-the-art integral distinguishers for all variants of the Speck family, significantly enhancing search efficiency for Speck-32/48/64/96 and detecting new integral distinguishers for Speck-48/64/96/128. Second, we determine the exact degrees of output bits for 7-round Speck-32 and all/16/2 output bits for 2/3/4-round Alzette for the first time. Third, we revisit the choice of rotation parameters in Speck instances, providing a criterion that enhances resistance against integral distinguishers. Additionally, we offer a simpler proof for Braeken and Semaev’s theorem using monomial prediction, demonstrating the potential of division property methods in the study of Boolean functions.We hope that the proposed methods will be valuable in the future design of ARX ciphers.

Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates

A large number of research efforts have been made in trying to solve global decision problems with cellular automata by means of their cells reaching a distributed consensus via their local action. Among them, the determination of the most frequent state in configurations with arbitrary size, i.e., the density classification task, has been the most widely approached benchmark problem. The literature abounds with cases demonstrating that, depending on how it is formulated, a solution can be shown to exist or not. Here we address the problem in terms of deterministic, block-sequential asynchronous updates, over cyclic configurations, by which the possibility of a solution remains open. Our main results are negative in terms of the possibility of solving the problem with such formulation, encompassing the cases of any cellular automaton with any sequential update, and any elementary cellular automaton with any block-sequential update; furthermore, we uncover some properties that any potential solution with block-sequential update should have in order for it to be a candidate to solving the problem. Incidentally, we also give a new, very simple proof of the impossibility of solving the problem with any synchronous rule.

The space of tracial states on a [formula omitted]-algebra

We give a simple and elementary proof that the tracial state space of a unital C∗-algebra is a Choquet simplex, using the center-valued trace on a finite von Neumann algebra.

Eigenfunctions and quantum transport with applications to trimmed Schrödinger operators

We provide a simple proof of dynamical delocalization, that is, time-increasing lower bounds on quantum transport for discrete, one-particle Schrödinger operators on ℓ2(Zd), provided solutions to the Schrödinger equation satisfy certain growth conditions. The proof is based on basic resolvent identities and the Combes-Thomas estimate on the exponential decay of the Green’s function. As a consequence, we prove that generalized eigenfunctions for energies outside the spectrum of H must grow exponentially in some directions. We also prove that if H has any absolutely continuous spectrum, then the Schrödinger operator exhibits dynamical delocalization. We apply the general result to Γ-trimmed Schrödinger operators, with periodic Γ, and prove dynamical delocalization for these operators. These results also apply to the Γ-trimmed Anderson model, providing a random, ergodic model exhibiting both dynamical localization in an energy interval and dynamical delocalization.

The principle of optimality in dynamic programming: A pedagogical note

The principle of optimality is a fundamental aspect of dynamic programming, which states that the optimal solution to a dynamic optimization problem can be found by combining the optimal solutions to its sub-problems. While this principle is generally applicable, it is often only taught for problems with finite or countable state spaces in order to sidestep measure-theoretic complexities. Therefore, it cannot be applied to classic models such as inventory management and dynamic pricing models that have continuous state spaces, and students may not be aware of the possible challenges involved in studying dynamic programming models with general state spaces. To address this, we provide conditions and a self-contained simple proof that establish when the principle of optimality for discounted dynamic programming is valid. These conditions shed light on the difficulties that may arise in the general state space case. We provide examples from the literature that include the relatively involved case of universally measurable dynamic programming and the simple case of finite dynamic programming where our main result can be applied to show that the principle of optimality holds.

Vector valued piecewise continuous almost automorphic functions and some consequences

In the present work, for X a Banach space, the notion of piecewise continuous Z-almost automorphic functions with values in finite dimensional spaces is extended to piecewise continuous Z-almost automorphic functions with values in X. Several properties of this class of functions are provided, in particular it is shown that if X is a Banach algebra, then this class of functions constitute also a Banach algebra; furthermore, using the theory of Z-almost automorphic functions, a new characterization of compact almost automorphic functions is given. As consequences, with the help of Z-almost automorphic functions, it is presented a simple proof of the characterization of almost automorphic sequences by compact almost automorphic functions; the method permits us to give explicit examples of compact almost automorphic functions which are not almost periodic. Also, using the theory developed here, it is shown that almost automorphic solutions of differential equations with piecewise constant argument are in fact compact almost automorphic. Finally, it is proved that the classical solution of the 1D heat equation with continuous Z-almost automorphic source is also continuous Z-almost automorphic; furthermore, we comment applications to the existence and uniqueness of the asymptotically continuous Z-almost automorphic mild solution to abstract integro-differential equations with nonlocal initial conditions.