English
Related papers

Related papers: Guessing genericity -- looking at parametrized dia…

200 papers

We study a random dynamical system such that one transformation is randomly selected from a family of transformations and then applied on each iteration. For such random dynamical systems, we consider estimates of absolutely continuous…

Dynamical Systems · Mathematics 2023-03-20 Tomoki Inoue

The gauge principle is proposed for rigid Lie-groupoidal symmetries $G=>M$ of the Polyakov-Alvarez-Gaw\k{e}dzki 2$d$ non-linear $\sigma$-model with metric target $(M,g_M)$ and the WZ term given by a CS differential character coming from an…

High Energy Physics - Theory · Physics 2026-03-24 Rafał R. Suszek

The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between…

Combinatorics · Mathematics 2015-11-02 Tri Lai

This paper addresses the problem of matching $N$ weighted graphs referring to an identical object or category. More specifically, matching the common node correspondences among graphs. This multi-graph matching problem involves two…

Computer Vision and Pattern Recognition · Computer Science 2016-06-14 Junchi Yan , Minsu Cho , Hongyuan Zha , Xiaokang Yang , Stephen Chu

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

Ezra Getzler notes in the proof of the main theorem of "The semi-classical approximation for modular operads" that "A proof of the theorem could no doubt be given using [a combinatorial interpretation in terms of a sum over necklaces];…

Algebraic Geometry · Mathematics 2013-08-27 Dan Petersen

We review the Dirac formalism for dealing with constraints in a canonical Hamiltonian formulation and discuss gauge freedom and display constraints for gauge theories in a general context. We introduce the Dirac bracket and show that it…

Mathematical Physics · Physics 2020-07-21 Jon Allen , Richard A. Matzner

In the present paper, we study a set that can be treated as a generalised set of subsums for a geometric series. This object was discovered independently in various mathematical aspects. For instance, it is closely related to various…

Probability · Mathematics 2024-10-22 Oleg Makarchuk , Dmytro Karvatskyi

We propose a handful of definitions of injectivity for a parametrized family of maps and study its link with a global nonuniform stability conjecture for nonautonomous differential systems, which has been recently introduced. This relation…

Algebraic Geometry · Mathematics 2025-01-22 Álvaro Castañeda , Ignacio Huerta , Gonzalo Robledo

Parameter estimation connects mathematical models to real-world data and decision making across many scientific and industrial applications. Standard approaches such as maximum likelihood estimation and Markov chain Monte Carlo estimate…

Methodology · Statistics 2026-02-06 Matthew J Simpson , James S Bennett , Alexander Johnston , Ruth E Baker

We study a family of distance functions on rankings that allow for asymmetric treatments of alternatives and consider the distinct relevance of the top and bottom positions for ordered lists. We provide a full axiomatic characterization of…

Computer Science and Game Theory · Computer Science 2024-03-28 Andrea Aveni , Ludovico Crippa , Giulio Principi

An earlier introduced characterization of nonuniform learnability that allows the sample size to depend on the hypothesis to which the learner is compared has been redefined using the measure theoretic approach. Where nonuniform…

Machine Learning · Computer Science 2020-11-03 Ankit Bandyopadhyay

A systematic procedure is proposed for deriving all the gauge symmetries of the general, not necessarily variational, equations of motion. For the variational equations, this procedure reduces to the Dirac-Bergmann algorithm for the…

Mathematical Physics · Physics 2015-05-13 S. L. Lyakhovich , A. A. Sharapov

In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F. Our key idea was to introduce an extended…

Logic · Mathematics 2021-01-05 Paolo Pistone , Luca Tranchini , Mattia Petrolo

Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…

Commutative Algebra · Mathematics 2019-10-15 Dmitry Kerner

Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…

Artificial Intelligence · Computer Science 2025-05-20 Christian Antić

A strong antidiamond principle (*c) is shown to be consistent with CH. This principle can be stated as a "P-ideal dichotomy": every P-ideal on omega-1 (i.e. an ideal that is sigma-directed under inclusion modulo finite) either has a closed…

Logic · Mathematics 2008-06-27 James Hirschorn

Motivated by the recent interest in models of guarded (co-)recursion, we study their equational properties. We formulate axioms for guarded fixpoint operators generalizing the axioms of iteration theories of Bloom and \'Esik. Models of…

Logic in Computer Science · Computer Science 2018-08-21 Stefan Milius , Tadeusz Litak

This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…

Statistics Theory · Mathematics 2007-06-13 Aijun Zhang , Kai-Tai Fang , Runze Li , Agus Sudjianto

We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative…

Social and Information Networks · Computer Science 2026-01-26 G. Exarchakos , R. van der Hofstad , O. Nagy , M. Pandey