text large_stringlengths 7 3.02k |
|---|
This article devoted to relativistic dynamics of a charged massive particle in an electroscalar field. It represents a continuation of paper [1] where the authors constructed a non-relativistic theory which describes transverse electromagnetic waves along with longitudinal electroscalar ones, responsible for the wave ... |
To have a closed system, the Maxwell equations should be supplemented by constitutive relations which connect the primary electromagnetic fields $(\bE,\bB)$ with the secondary ones $(\bD,\bH)$ induced in a medium. Recently [Opt. |
Resonances usually result from wave superpositions in cavities where they are due to the wave spatio-temporal folding imposed by the boundaries. These energy accumulations are the signature of the cavity eigenmodes. |
A beautiful theorem due to J. L. F. Bertrand concerning the laws of attraction that admit bounded closed orbits for arbitrarily chosen initial conditions is translated from French into English. |
We describe an improvement on the magnetic scalar potential approach to the design of an electromagnet, which incorporates the need to wind the coil as a helix. Any magnetic field that can be described by a magnetic scalar potential is produced with high fidelity within a Target region; all fields are confined within ... |
We give a concise axiomatic introduction into the fundamental structure of classical electrodynamics: It is based on electric charge conservation, the Lorentz force, magnetic flux conservation, and the existence of local and linear constitutive relations. The {\it inhomogeneous} Maxwell equations, expressed in terms o... |
Spatial coherence of thermal fields in far- and near-field zones generated by heated half-space into vacuum is studied at essentially different thermodynamical conditions. It is shown that correlation lengths of fields in any field zone are different in equilibrium and out of equilibrium systems. |
How can we design the shape of an object, in the framework of Newtonian gravity, in order to generate maximum gravity at a given point in space? In this work we present a study on this interesting problem. |
The closedness of orbits of central forces is addressed in a three dimensional space in which the Poisson bracket among the coordinates is that of the SU(2) Lie algebra. In particular it is shown that among problems with spherically symmetric potential energies, it is only the Kepler problem for which all of the bound... |
To study the microscopic origins of friction, we build a framework to describe the collective behaviour of a large number of individual micro-junctions forming a macroscopic frictional interface. Each micro-junction can switch in time between two states: A pinned state characterized by a displacement-dependent force, ... |
After a short critique of the Minkowski formulae for the electromagnetic constitutive laws in moving media, we argue that in actual fact the problem of Lorentz-covariant electromagnetic response theory is automatically solved within the framework of modern microscopic electrodynamics of materials. As an illustration, ... |
We propose wave and ray approaches for modelling mid- and high- frequency structural vibrations through smoothed joints on thin shell cylindrical ridges. The models both emerge from a simplified classical shell theory setting. |
We discuss the regions forbidden to classical scattering trajectories by repulsive potentials. We give explicit results for the asymptotic form of these regions, far from the scattering center, in terms of the scattering angle function. |
We consider electromagnetic nonlinear normal modes in cylindrical cavity resonators filled with a nonlinear nondispersive medium. The key feature of the analysis is that exact analytical solutions of the nonlinear field equations are employed to study the mode properties in detail. |
Fluctuation theorems have a very special place in the study of non equilibrium dynamics of physical systems. The form in which it is used most extensively is the Gallavoti-Cohen Fluctuation Theorem which is in terms of the distribution of the work $p(W)/p(-W)=\exp(\alpha W)$. |
The effect of asymmetric functionally graded material on the edge resonance and the Fano resonance in semi-infinite FGM plates are reported in this work. The edge resonance is weakened by the material perturbation and the complete mode conversion is illustrated with incident $S_0$ mode. |
We present an analysis on the geometrical place formed by the set of maxima of the trajectories of a projectile launched in a media with linear drag. Such a place, the locus of apexes, is written in term of the Lambert $W$ function in polar coordinates, confirming the special role played by this function in the proble... |
The Frequency Response Functions (FRFs) are the most widely used functions to characterise the dynamic behaviour of structures. The natural frequencies and damping behaviour can be easily and quickly detected from a Bode diagram. |
The existence of a maximal acceleration for massive objects was conjectured by Caianiello 30 years ago based on the Heisenberg uncertainty relations. Many consequences of this hypothesis have been studied, but until now, there has been no evidence that boundedness of the acceleration may lead to quantum behavior. |
We present an educational path on the magnetic vector potential A addressed to undergraduate students and to pre-service physics teachers. Starting from the generalized Ampere-Laplace law, in the framework of a slowly varying time-dependent field approximation, the magnetic vector potential is written in terms of its ... |
The question of what is the source of the energy carried by the radiation is discussed. The case of a hyperbolic motion is analyzed, describing the solutions suggested in the past for the "energy balance paradox". |
In order to make plausible the idea that light exerts a pressure on matter, some introductory physics texts consider the force exerted by an electromagnetic wave on an electron. The argument as presented is both mathematically incorrect and has several serious conceptual difficulties without obvious resolution at the ... |
In this work, Gibbs paradox was discussed from the view of observer. The limitations of real observer are analyzed quantitatively. |
We show that the theory of self-adjoint differential equations can be used to provide a satisfactory solution of the inverse variational problem in classical mechanics. A Newtonian equation when transformed to the self-adjoint form allows one to find an appropriate Lagrangian representation (direct analytic representa... |
Let $\mathcal{S}$ be a finite commutative semigroup. The Davenport constant of $\mathcal{S}$, denoted ${\rm D}(\mathcal{S})$, is defined to be the least positive integer $\ell$ such that every sequence $T$ of elements in $\mathcal{S}$ of length at least $\ell$ contains a proper subsequence $T'$ ($T'\neq T$) wi... |
Krasnosselsky's art gallery theorem gives a combinatorial characterization of star-shaped sets in Euclidean spaces, similar to Helly's characterization of finite families of convex sets with non-empty intersection. We study colorful and quantitative variations of Krasnosselsky's result. |
Fisher proved in 1940 that any $2$-$(v,k,\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\lambda)$ design with $v \geq k+\lfloor t/2 \rfloor$ has at least $\binom{v}{\lfloor t/2 \rfloor}$ blocks. |
Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. |
Connectivity is a cornerstone concept in graph theory, essential for evaluating the robustness of networks against failures. To better capture fault tolerance in complex systems, researchers have extended classical connectivity notions, one such extension being the $k$-path-connectivity, $\pi_k(G)$, introduced by Hage... |
Let $G$ be a connected graph. If $G$ contains a matching of size $k$, and every matching of size $k$ is contained in a perfect matching of $G$, then $G$ is said to be \emph{$k$-extendable}. |
A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if there is a rainbow path connecting any two vertices, and the rainbow connection number of $G$, denoted by $rc(G)$, is the... |
DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which was conjectured by Borodin {\it et al. } in 2007. |
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler genus, graphs embeddable on a fixed surface with a bounded number of crossings p... |
A collection of open problems in Costas arrays is presented, classified into several categories, along with the context in which they arise. |
Caro and Yuster (Electronic <a href="http://J.Comb" rel="external noopener nofollow" class="link-external link-http">this http URL</a> 7 (2000)) studied a generalization of the Turan problem, where a certain function (instead of the size) of an F-free graph of order n has to be maximized. We prove that for a wide clas... |
A Frobenius group is a transitive but not regular permutation group such that only the identity element can fix two points. A finite Frobenius group can be expressed as $G = K \rtimes H$ with $K$ a nilpotent normal subgroup. |
Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey. |
The revised version of the claim by Hurley, Hurley and Hurley to have proved the circulant Hadamard matrix conjecture is mistaken. |
By using the Transfer Matrix Method, explicit formulas for the embedding distribution of doubly hexagonal chain graphs are computed. |
For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove that for every prime $p$ there exists some $\delta = \delta(p)>0$, such that fo... |
The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful simplices generated by taking one point from each set. A construction attaining d^2+1 s... |
The well-known Van Lint--MacWilliams' conjecture states that if $q$ is an odd prime power, and $A\subseteq \mathbb{F}_{q^2}$ such that $0,1 \in A$, $|A|=q$, and $a-b$ is a square for each $a,b \in A$, then $A$ must be the subfield $\mathbb{F}_q$. This conjecture was first proved by Blokhuis and is often phrased in... |
Let ${\cal M}$ be a map with the underlying graph $\Gamma$. The automorphism group $Aut({\cal M})$ induces a natural action on the set of all vertex-edge-face incident triples, called {\em flags} of ${\cal M}$. |
We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already well understood, in the sense that it is known precisely for which cases the gener... |
Hou, Krattenthaler, and Sun have introduced two $q$-analogues of a remarkable series for $\pi^2$ due to Guillera, and these $q$-identities were, respectively, proved with the use of a $q$-analogue of a Wilf-Zeilberger pair provided by Guillera and with the use of ${}_{3}\phi_{2}$-transforms. We prove a $q$-analogue of... |
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal by inclusion weakly separated collections of minors have the same cardinality, and that they can be related to each other by a sequence of ... |
We show a new reduction method on a simplicial complex. This reduction works well with relations and Dowker complexes. |
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size of a resolving set for $\Gamma$. |
Bicolored tilings are given by a collection of smooth curves in a disk with a coloring map on the tiles these curves form. Postnikov diagrams can be viewed as the image of certain bicolored tilings under the Scott map. |
Petford and Welsh introduced a sequential heuristic algorithm for (approximately) solving the NP-hard graph coloring problem. The algorithm is based on the antivoter model and mimics the behaviour of a physical process based on a multi-particle system of statistical mechanics. |
The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. |
Tight-spans of metrics were first introduced by Isbell in 1964 and rediscovered and studied by others, most notably by Dress, who gave them this name. Subsequently, it was found that tight-spans could be defined for more general maps, such as directed metrics and distances, and more recently for diversities. |
We compute the number of rhombus tilings of a hexagon with sides $N,M,N,N,M,N$, which contain a fixed rhombus on the symmetry axis. A special case solves a problem posed by Jim Propp. |
The bondage number of a nonempty graph $G$ is the cardinality of a smallest edge set whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. This lecture gives a survey on the bondage number, including the known results, problems and conjectures. |
The Gyarfas-Sumner conjecture asserts that if H is a tree then every graph with bounded clique number and very large chromatic number contains H as an induced subgraph. This is still open, although it has been proved for a few simple families of trees, including trees of radius two, some special trees of radius three,... |
In this paper, we present a variant of the Balog-Szemerédi-Gowers theorem for the Vinogradov system. We then use our result to deduce a higher degree analogue of the sum-product phenomenon. |
It is way too soon to teach our computers how to become full-fledged humans. It is even premature to teach them how to become mathematicians, it is even unwise, at present, to teach them how to become combinatorialists. |
Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. |
Guided by the theory of graph limits, we investigate a variant of the cut metric for limit objects of sequences of discrete probability distributions. Apart from establishing basic results, we introduce a natural operation called {\em pinning} on the space of limit objects and show how this operation yields a canonica... |
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result was extended for arbitrary semigroups by Bergelson and Hindman, again using the ... |
This work is about self-similar sequences of growing connected graphs. We explain how to construct such sequences and why they are important. |
We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position into an iterated ordinal sum. |
In this paper we investigate the traces of the adjacency tensor of hypergraphs (simply called the traces of hypergraphs). We give new expressions for the traces of hypertrees and linear unicyclic hypergraphs by the weight function assigned to their connected sub-hypergraphs, and provide some perturbation results for t... |
The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter's friezes. Their number and their properties are closely linked to the structure and the cardinality of the chosen set. |
We show that the symmetric difference distance measure for set systems, and more specifically for delta-matroids, corresponds to the notion of nullity for symmetric and skew-symmetric matrices. In particular, as graphs (i.e., symmetric matrices over GF(2)) may be seen as a special class of delta-matroids, this distanc... |
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley sequences. |
A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of combinatorial objects, such as Grassmann necklaces and decorated permutations. |
A tangle is a connected topological space constructed by gluing several copies of the unit interval $[0, 1]$. We explore which tangles guarantee envy-free allocations of connected shares for n agents, meaning that such allocations exist no matter which monotonic and continuous functions represent agents' valuation... |
We present a unified approach to various examples of Markov dynamics on partitions studied by Borodin, Olshanski, Fulman, and the author. Our technique generalizes the Kerov's operators first appeared in [Okounkov, <a href="https://arxiv.org/abs/math/0002135" data-arxiv-id="math/0002135" class="link-https">arXiv:m... |
A clutter is \emph{clean} if it has no delta or the blocker of an extended odd hole minor, and it is \emph{tangled} if its covering number is two and every element appears in a minimum cover. Clean tangled clutters have been instrumental in progress towards several open problems on ideal clutters, including the $\tau=... |
We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs. |
A prism tableau is a set of reverse semistandard tableaux, each positioned within an ambient grid. Prism tableaux were introduced to provide a formula for the Schubert polynomials of A. Lascoux and M.P. Schützenberger. |
The Hermitian Veronesean in $PG(3,q^2)$, given by $\mathcal{V}:=\{ (1,x,x^q,x^{q+1}):x\in\mathbb{F}_q\}\cup\{(0,0,0,1)\}$, is a well-studied rational curve, and forms a {\em special} set of the Hermitian surface $H(3,q^2)$. In this paper, we give two local characterisations of the Hermitian Veronesean, based on sublin... |
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For instance kayak, radar, or rotor. |
When $H$ is a forest, the Gyárfás-Sumner conjecture implies that every graph $G$ with no induced subgraph isomorphic to $H$ and with bounded clique number has a stable set of linear size. We cannot prove that, but we prove that every such graph $G$ has a stable set of size $|G|^{1-o(1)}$. |
We define Chern-Schwartz-MacPherson (CSM) cycles of an arbitrary matroid. These are balanced weighted fans supported on the skeleta of the corresponding Bergman fan. |
In this paper, we first describe how to find the generating function for the sum of the areas under generalized Dyck paths (with an arbitrary set of steps) using Motzkin paths as a motivating example. We then focus on Motzkin and Dyck paths, deriving functional equations for them. |
Hernando et al. (2008) introduced the fault-tolerant metric dimension $\text{ftdim}(G)$, which is the size of the smallest resolving set $S$ of a graph $G$ such that $S-\left\{s\right\}$ is also a resolving set of $G$ for every $s \in S$. They found an upper bound $\text{ftdim}(G) \le \dim(G) (1+2 \cdot 5^{\dim(G)-1})... |
Given a simple undirected graph $G$ and a positive integer $k$, the $k$-forcing number of $G$, denoted $F_k(G)$, is the minimum number of vertices that need to be initially colored so that all vertices eventually become colored during the discrete dynamical process described by the following rule. Starting from an ini... |
We consider a system in which a group of agents represented by the vertices of a graph synchronously update their opinion based on that of their neighbours. If each agent adopts a positive opinion if and only if that opinion is sufficiently popular among his neighbours, the system will eventually settle into a fixed s... |
Let $r$ be an integer with $r\ge 2$ and $G$ be a connected $r$-uniform hypergraph with $m$ edges. By refining the broken cycle theorem for hypergraphs, we show that if $k>\frac{m-1}{\ln(1+\sqrt{2})}\approx 1.135 (m-1)$ then the $k$-list assignment of $G$ admitting the fewest colorings is the constant list assignmen... |
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in $n$-vertex $F$-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results. |
We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. <br>Keywords: planar graph, choosability <br>AMS Mathematics Subject Classification: 05C15 |
M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)! . |
Let $P(n)$ denote the set of all partitions of $n$, whose elements are nondecreasing sequences of positive integers whose sum is $n$. For ${\bf a}=( n_{1}, n_{2},\ldots, n_{d}) \in P(n)$, let $G({\bf a},v)$ denote the graph obtained from connected graph $G$ appending $d$ paths with lengths $n_{1},n_{2},\ldots,n_{d}$ o... |
We consider two families of polynomials that play the same role in the Temperley Lieb algebra of a Coxeter group as the Kazhdan Lusztig and R polynomials play in the Hecke algebra of the group. We study these polynomials from a combinatorial point of view. |
Let $f:V \rightarrow \mathbb{N}$ be a function on the vertex set of the graph $G=(V,E)$. The graph $G$ is {\em $f$-choosable} if for every collection of lists with list sizes specified by $f$ there is a proper coloring using colors from the lists. |
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. |
Babson and Steingr\'ımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of permutations avoiding any single pattern of type $(1,2)$ or $(2,1)$. |
The {\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. In this paper we first determine the rainbow vertex-connection num... |
Let $G_{n,p}$ be the standard Erdős-Rényi-Gilbert random graph and let $G_{n,n,p}$ be the random bipartite graph on $n+n$ vertices, where each $e\in [n]^2$ appears as an edge independently with probability $p$. For a graph $G=(V,E)$, suppose that each edge $e\in E$ is given an independent uniform exponential rate one ... |
The signature of a spanning tree $T$ of the $n$-cube $Q_n$ is the $n$-tuple $\mathrm{sig}(T)=(a_1,a_2,\dots,a_n)$ such that $a_i$ is the number of edges of $T$ in the $i$th direction. We characterise the $n$-tuples that can occur as the signature of a spanning tree, and classify a signature $\mathcal{S}$ as reducible ... |
In this paper, we look at the number of factorizations of a given permutation into star transpositions. In particular, we give a natural explanation of a hidden symmetry, answering a question of I.P. Goulden and D.M. Jackson. |
If $M$ is an $m \times m$ matrix over $\{ 0, 1, \ast \}$, an $M$-partition of a graph $G$ is a partition $(V_1, \dots V_m)$ such that $V_i$ is completely adjacent (non-adjacent) to $V_j$ if $M_{ij} = 1$ ($M_{ij} = 0$), and there are no further restrictions between $V_i$ and $V_j$ if $M_{ij} = \ast$. Having an $M$-part... |
The parity type of a Latin square is defined in terms of the numbers of even and odd rows and columns. It is related to an Alon-Tarsi-like conjecture that applies to Latin squares of odd order. |
In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographiically shellable poset. |
In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small "admissible" subset of these linear extensions, determined implicitly b... |
Let $D(G)=(d_{ij})_{n\times n}$ be the distance matrix of a graph $G$ of order $n$. The largest eigenvalue of $D(G)$, denoted by $\mu(G)$, is called the distance spectral radius of $G$. |
The Heilmann--Lieb theorem is a fundamental theorem in algebraic combinatorics which provides a characterization of the distribution of the zeros of matching polynomials of graphs. In this paper, we establish a hypergraph Heilmann--Lieb theorem as follows. Let $\h$ be a connected $k$-graph with maximum degree ${\Delta... |
The anti-forcing number of a connected graph $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the anti-forcing number of every fullerene has at least four. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.