English
Related papers

Related papers: Join-irreducible Boolean functions

200 papers

We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate. From this we derive that each such polynomial can be approximated by a hyperbolic polynomial. As a by product we prove that the Julia set…

Dynamical Systems · Mathematics 2014-02-26 Oleg Kozlovski , Sebastian van Strien

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

Representation Theory · Mathematics 2014-07-28 Jeffrey D. Adler , Joshua M. Lansky

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…

Logic · Mathematics 2021-03-17 Boris Šobot

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

We give a notion of "combinatorial proximity" among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees "geometric proximity" of the corresponding points in the Hilbert…

Algebraic Geometry · Mathematics 2020-06-02 Yuta Kambe , Paolo Lella

Let $Y$ denote a $D$-class symmetric association scheme with $D \geq 3$, and suppose $Y$ is almost-bipartite P- and Q-polynomial. Let $x$ denote a vertex of $Y$ and let $T=T(x)$ denote the corresponding Terwilliger algebra. We prove that…

Combinatorics · Mathematics 2007-05-23 John S. Caughman , Mark S. MacLean , Paul M. Terwilliger

A wide class of Hamiltonian systems with N degrees of freedom and endowed with, at least, (N-2) functionally independent integrals of motion in involution is constructed by making use of the two-photon Lie-Poisson coalgebra. The set of…

Mathematical Physics · Physics 2009-06-19 Angel Ballesteros , Alfonso Blasco , Francisco J. Herranz

We consider the correlations of invariant observables for the $O(N)$ and $\mathbb{C}\mathbb{P}^{N-1}$ models at zero coupling, namely, with respect to the natural group-invariant measure. In the limit where one takes a large power of the…

Mathematical Physics · Physics 2022-08-05 Abdelmalek Abdesselam

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Cryptography and Security · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…

Group Theory · Mathematics 2016-05-26 Z. Mesyan , J. D. Mitchell , M. Morayne , Y. H. Péresse

Let G be the group of points of a quasi-split reductive algebraic group over a local field F. It follows from the local Langlands conjectures that to every non-trivial additive character of F and every representation of the Langlands dual…

Algebraic Geometry · Mathematics 2007-05-23 Alexander Braverman , David Kazhdan , V. Vologodsky

We prove that Boolean functions on $S_{n}$ whose Fourier transform is highly concentrated on the first two irreducible representations of $S_n$, are close to being unions of cosets of point-stabilizers. We use this to give a natural proof…

Combinatorics · Mathematics 2017-07-03 David Ellis , Yuval Filmus , Ehud Friedgut

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…

Combinatorics · Mathematics 2016-12-15 Benedikt Stufler

The {\it profile} of a relational structure $R$ is the function $\phi_R$ which counts for every integer $n$ the number of its $n$-element substructures up to an isomorphism. Many counting functions are profiles. Interesting examples come…

Combinatorics · Mathematics 2007-05-23 Maurice Pouzet

An n-ary operation q:A^n->A is called an n-ary quasigroup of order |A| if in x_0=q(x_1,...,x_n) knowledge of any n elements of x_0,...,x_n uniquely specifies the remaining one. An n-ary quasigroup q is permutably reducible if…

Combinatorics · Mathematics 2008-05-10 Denis Krotov

The superintegrability of four Hamiltonians $\tilde{H_r} = \lambda\, H_r$, $r=a,b,c,d$, where $H_r$ are known Hamiltonians and $\lambda$ is a certain function defined on the configuration space and depending of a parameter $\kappa$, is…

Mathematical Physics · Physics 2020-02-14 Manuel F. Ranada

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…

Classical Analysis and ODEs · Mathematics 2015-06-02 Subuhi Khan , Mumtaz Riyasat

We study irreducible Smale spaces with totally disconnected stable sets and their associated $K$-theoretic invariants. Such Smale spaces arise as Wieler solenoids, and we restrict to those arising from open surjections. The paper follows…

Dynamical Systems · Mathematics 2019-03-05 Robin J. Deeley , Magnus Goffeng , Bram Mesland , Michael F. Whittaker

One way to study the combinatorics of finite metric spaces is to study the betweenness relation associated with the metric space. In the hypergraph metrization problem, one has to find and characterize metric betweennesses whose collinear…

Combinatorics · Mathematics 2018-06-07 Péter G. N. Szabó