English
Related papers

Related papers: A study on the fixed points of the $\gamma$ functi…

200 papers

We discuss the Hamiltonian formulation of the Schwinger proper-time method of calculating Green functions in gauge theories. Instead of calculating Feynman diagrams, we solve the corresponding Dyson-Schwinger equations. We express the…

High Energy Physics - Phenomenology · Physics 2011-07-19 George Siopsis

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Formal Languages and Automata Theory · Computer Science 2012-03-30 Dane Henshall , Jeffrey Shallit

Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…

Neural and Evolutionary Computing · Computer Science 2013-01-18 Benjamin Doerr , Anton Eremeev , Frank Neumann , Madeleine Theile , Christian Thyssen

This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…

Logic in Computer Science · Computer Science 2008-12-16 Luigi Santocanale , Yde Venema

Generative machine learning models offer a powerful framework for therapeutic design by efficiently exploring large spaces of biological sequences enriched for desirable properties. Unlike supervised learning methods, which require both…

In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…

Functional Analysis · Mathematics 2023-01-24 Pallab Maiti , Asrifa Sultana

The aim of the article is to recover a certain type of finite parametric distributions and functions using their spherical mean transform which is given on a certain family of spheres whose centers belong to a finite set $\Gamma$. For this,…

Analysis of PDEs · Mathematics 2016-11-01 Yehonatan Salman

Fixed point lattice actions are designed to have continuum classical properties unaffected by discretization effects and reduced lattice artifacts at the quantum level. They provide a possible way to extract continuum physics with coarser…

High Energy Physics - Lattice · Physics 2024-10-04 Kieran Holland , Andreas Ipp , David I. Müller , Urs Wenger

Motivated by our recent work relating canonical bases to combinatorics of Garsia-Procesi modules \cite{B}, we give an insertion algorithm that computes the catabolizability of the insertion tableau of a standard word. This allows us to…

Combinatorics · Mathematics 2009-08-17 Jonah Blasiak

In this paper we study positive fixed points of Hammerstein integral operators with degenerate kernel in the cone of C[0, 1]. Problem on a number of positive fixed points of the Hammerstein integral operator leads to the study positive…

Functional Analysis · Mathematics 2019-11-26 Eshkabilov Yusup Khalbaevich

We introduce a systematic mathematical language for describing fixed point models and apply it to the study to topological phases of matter. The framework is reminiscent of state-sum models and lattice topological quantum field theories,…

Quantum Physics · Physics 2022-07-28 A. Bauer , J. Eisert , C. Wille

We introduce the novel concept of a non-stationary iterated function system by considering a countable sequence of distinct set-valued maps $\{\mathcal{F}_k\}_{k\in \mathbb{N}}$ where each $\mathcal{F}_k$ maps $\mathcal{H}(X)\to…

Dynamical Systems · Mathematics 2019-07-02 Peter Massopust

We propose a new alignment-free algorithm by constructing a compact vector representation on $\mathbb{R}^{24}$ of a DNA sequence of arbitrary length. Each component of this vector is obtained from a representative sequence, the elements of…

Data Structures and Algorithms · Computer Science 2024-09-27 Probir Mondal , Pratyay Banerjee , Debranjan Pal , Krishnendu Basuli

A discrete analog of the holomorphic map $z^{\gamma}$ is studied. It is given by Schramm's circle pattern with the combinatorics of the square grid. It is shown that the corresponding circle patterns are embedded and described by special…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 S. I. Agafonov

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…

Group Theory · Mathematics 2008-06-11 Benson Farb

Grover recently presented the fixed-point search algorithm. In this letter, we study the fixed-point search algorithm obtained by replacing equal phase shifts of $\pi /3$ by different phase shifts.

Quantum Physics · Physics 2012-05-08 D. Li , X. Li , H. Huang , X. Li

This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…

Logic in Computer Science · Computer Science 2020-08-04 Michael J. Maher

We prove exact formulas for weighted $2k$th moments of the Riemann zeta function for all integer $k\geq 1$ in terms of the analytic continuation of an auto-correlation function. This latter enjoys several functional equations. One of them,…

Number Theory · Mathematics 2023-11-07 Sébastien Darses , Joseph Najnudel

In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…

Mathematical Physics · Physics 2016-05-17 Mohamed Belhaj Mohamed

We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…

Combinatorics · Mathematics 2007-06-01 Nicholas A. Loehr , Gregory S. Warrington